Invited speakers
DCFS 2025 features a distinguished group of invited speakers presenting research on topics such as formal languages, reversible computing, and natural computing. Their talks will offer valuable insights and spark discussions throughout the conference.
Wheeler Automata in Formal Language Theory
Giuseppa Castiglione (Palermo, Italy)
Inductive Inference of Lindenmayer Systems - Computational and Descriptional Complexity
Ian McQuillan (Saskatoon (SK), Canada)
Can We Efficiently Compute Concurrency and Causality Relations in the Reversible Setting?
Irek Ulidowski (Leicester, UK)
Honorary talk
Descriptional Complexity in Natural Computing: the Case of P Systems
Erzsébet Csuhaj-Varjú (Budapest, Hungary)