About:
The 28th International Conference on Developments in Language Theory (DLT 2024) is an event organized to bring together members of the academic, research, and industrial community who have an interest in formal languages, automata theory, and related areas. The conference will be held in conjunction with the 14th International Workshop on Non-Classical Models of Automata and Applications (NCMA 2024) in Göttingen, Germany.
Registration:
The registration is open here: https://express.converia.de/frontend/index.php?sub=1519
Full Registration: 270 Euro (early bird); 350 Euro (late)
Student Registration: 150 Euro (early bird); 200 Euro (late)
Early bird: until 20.7.2024
The registration covers the participation to the conference and social events (please check the respective boxes during the registration, to allow us a better estimation of the number of participants in each event). DLT 2024 supports and is committed to the principles of SafeToC (http://safetoc.org ). Registering for DLT 2024 thus requires that you agree to follow the Code of Conduct described below.
Please also note that at least one author of every accepted paper needs to register and pay the registration fee.
Code of conduct: DLT 2024 is committed to be a respectful forum for its participants, free from any violence, discrimination or harassment of any nature. All DLT 2024 attendees are expected to behave accordingly.
If you experience or witness violence, discrimination, harassment or other unethical behaviour at the conference, we encourage you to seek advice and remedy through by reporting to the organizers, the PC chairs or the Steering Committee chair. The chairs are entitled to remove registered participants from the conference (without refunding the conference fees) if they are deemed to pose an ethical risk to other participants. The conference chair may contact the local university officials dedicated to address violence, unethical behaviour or harassment of any kind. Besides having an appointment with the victim, these officials can assist with medical support and with taking legal action.
Invited Speakers
Laura Ciobanu (Edinburgh, UK)
Pawel Gawrychowski (Wroclaw, Poland)
Sandra Kiefer (Oxford, UK)
Martin Kutrib (Gießen, Germany), unifying speaker with NCMA 2024.
Highlights of Language Theory:
DLT 2024 will host a series of talks on new exciting results in the area of formal languages and automata theory, based on recent papers presented at other conferences:
C. Aiswarya, Amaldev Manuel and Saina Sunny. Edit Distance of Finite State Transducers (based on a paper presented at ICALP 2024)
Paul Gallot, Sebastian Maneth, Keisuke Nakano and Charles Peyrat. Deciding Linear Height and Linear Size-to-Height Increase of Macro Tree Transducers (based on a paper presented at ICALP 2024)
Stefan Göller and Nathan Grosshans. The AC0-Complexity Of Visibly Pushdown Languages (based on a paper presented at STACS 2024)
Markus Lohrey, Markus L. Schmid: Enumeration for MSO-Queries on Compressed Trees (two talks based on a paper presented at PODS 2024)
Irmak Sağlam, Moses Ganardi and Georg Zetzsche. Directed Regular and Context-Free Languages (based on a paper presented at STACS 2024)
Accepted Papers:
- Michele Chiari, Dino Mandrioli and Matteo Pradella. Cyclic Operator Precedence Grammars for Improved Parallel Parsing
- Benedek Nagy and Friedrich Otto. Finite Automata with Sets of Translucent Words
- Oscar Ibarra and Ian McQuillan. Techniques for Showing the Decidability of the Boundedness Problem of Language Acceptors
- Marco Sälzer, Eric Alsmann, Florian Bruse and Martin Lange. Verifying And Interpreting Neural Networks using Finite Automata
- Ferdinando Cicalese and Francesca Ugazio. On the complexity and approximability of Bounded access Lempel Ziv coding
- Marco B. Caminati. $O_2$ is a multiple context-free grammar: an implementation-, formalisation-friendly proof
- Yinfeng Zhu. Around Don's conjecture for binary completely reachable automata
- Yusuke Inoue, Kenji Hashimoto and Hiroyuki Seki. Semidirect Product Decompositions for Periodic Regular Languages
- Martin Kutrib, Andreas Malcher, Carlo Mereghetti, Beatrice Palano, Priscilla Raucci and Matthias Wendlandt. Deterministic Pushdown Automata with Translucent Input Letters
- Philomena Moek. Network Topologies for Parallel Communicating Finite Automata: Token-Ring and Token-Bus
- Travis Gagie. How to Find Long Maximal Exact Matches and Ignore Short Ones
- Sungmin Kim and Yo-Sub Han. Approximate Cartesian Tree Pattern Matching
- Ingyu Baek, Joonghyuk Hahn, Yo-Sub Han and Kai Salomaa. Universal Rewriting Rules for the Parikh Matrix Injectivity Problem
- Hermann Gruber, Markus Holzer and Christian Rauch. The Pumping Lemma for Context-Free Languages is Undecidable
- C Aiswarya, Saina Sunny and Amaldev Manuel. Deciding Conjugacy of a Rational Relation
- Amazigh Amrane, Hugo Bazille, Uli Fahrenberg and Marie Fortin. Logic and Languages of Higher-Dimensional Automata
Important Dates:
| Deadline for paper submission: | |
| Notification: | |
| Final Version: | 17 May 2024 |
| DLT 2024: | 12-16 August 2024 |
Submission guidelines:
Please submit your paper here: https://easychair.org/conferences/?conf=dlt2024. Submitted papers should not exceed 12 pages excluding bibliography, the title page (containing only the title, authors, affiliations, abstract), and a potential appendix (see below), and must follow the LNCS-style LaTex2e (available at https://www.springer.com/gp/computer-science/lncs/conference-proceedings-guidelines). Proofs omitted due to space constraints should be put into an appendix, to be read by the program committee members at their discretion.
Salomaa Prize:
The Developments in Language Theory (DLT) Symposium has decided to create a prize to be awarded during the DLT conference. The Salomaa Prize is named to honour the scientific achievements and influence of Academician Arto Salomaa, a founder of the DLT symposium. The prize consists of a diploma and 2000 euros, funded by the University of Turku, Finland, the home university of Arto Salomaa. The Salomaa Prize 2024 will be awarded during the DLT 2024 conference.
List of Topics:
- grammars, acceptors, and transducers for words, trees, and graphs
- algebraic theories of automata
- algorithmic, combinatorial, and algebraic properties of words and languages
- relations between formal languages and artificial neural networks
- computational linguistics and natural language processing
- variable length codes
- symbolic dynamics
- cellular automata
- groups and semigroups generated by automata
- polyominoes and multidimensional patterns
- decidability questions
- image manipulation and compression
- efficient text algorithms
- relationships to cryptography, concurrency, complexity theory, and logic
- bio-inspired computing
- quantum computing
Program Committee:
- Marie-Pierre Béal
- Joel Day (chair)
- Dora Giammarresi
- Yo-Sub Han
- Mika Hirvensalo
- Markus Holzer
- Tomohiro I
- Zsuzsanna Liptak
- Florin Manea (chair)
- Sebastian Maneth
- Ian McQuillan
- Robert Mercas
- Cyril Nicaud
- Svetlana Puzynina
- Daniel Reidenbach
- Arseny Shur
- Manon Stipulanti
- Bianca Truthe
- Mikhail Volkov
- Markus Whiteland
- Georg Zetzsche
Supported by:
