Search the Dagstuhl Website
Looking for information on the websites of the individual seminars? - Then please:
Not found what you are looking for? - Some of our services have separate websites, each with its own search option. Please check the following list:
Schloss Dagstuhl - LZI - Logo
Schloss Dagstuhl Services
Within this website:
External resources:
  • DOOR (for registering your stay at Dagstuhl)
  • DOSA (for proposing future Dagstuhl Seminars or Dagstuhl Perspectives Workshops)
Within this website:
External resources:
Within this website:
External resources:
  • the dblp Computer Science Bibliography

Dagstuhl Seminar 25141

Categories for Automata and Language Theory

( Mar 30 – Apr 04, 2025 )

Please use the following short url to reference this page:




Categorical methods have a long history in automata and language theory, but a coherent theory has started to emerge only in recent years. Some recent examples of categorical methods in automata theory include monadic, coalgebraic, functorial, fibrational and profinite approaches. Such an abstract viewpoint can provide a unifying perspective on various forms of automata; it can make it easier to bootstrap a theory in a new setting; and it provides conceptual clarity regarding which aspects and properties are fundamental and which are only coincidental.

Due to being in its early stages, the field is currently still divided into several different communities with little connections between them. The purpose of this seminar is to connect these communities; to initiate collaborations; and to discuss recent developments and possible ways to go forward. The seminar will mix researchers of different backgrounds, in order to achieve a healthy balance between abstraction and applications in automata theory.

We hope that the meeting will foster further interaction between the different communities. It should benefit category theorists, who may or may not have studied computation theory before, by inspiring them to look at problems motivated by automata and formal languages. It should also be useful to automata theorists, who may or may not be familiar with categorical techniques, by exposing them to the scope and strength of these techniques. We hope that this interaction will be both productive and enjoyable for all participants.

Copyright Achim Blumensath, Mikolaj Bojanczyk, Bartek Klin, and Daniela Petrisan

  • Formal Languages and Automata Theory
  • Logic in Computer Science

  • category theory
  • automata
  • formal language theory