default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID26th CIAA 2022: Rouen, France
- Pascal Caron, Ludovic Mignot:
Implementation and Application of Automata - 26th International Conference, CIAA 2022, Rouen, France, June 28 - July 1, 2022, Proceedings. Lecture Notes in Computer Science 13266, Springer 2022, ISBN 978-3-031-07468-4
Invited Lectures
- Hermann Gruber
, Markus Holzer, Christian Rauch:
On 25 Years of CIAA Through the Lens of Data Science. 3-18 - Nelma Moreira, Rogério Reis:
Manipulation of Regular Expressions Using Derivatives: An Overview. 19-33 - Sicheol Sung, Hyunjoon Cheon, Yo-Sub Han:
How to Settle the ReDoS Problem: Back to the Classical Automata Theory. 34-49
Conference Papers
- Brink van der Merwe, Martin Berglund:
Ordered Context-Free Grammars. 53-66 - Florent Jacquemard, Lydia Rodriguez de la Nava:
Symbolic Weighted Language Models, Quantitative Parsing and Automated Music Transcription. 67-79 - Florian Bruse, Maurice Herwig, Martin Lange:
A Similarity Measure for Formal Languages Based on Convergent Geometric Series. 80-92 - Frank Drewes, Richard Mörbitz, Heiko Vogler:
Hybrid Tree Automata and the Yield Theorem for Constituent Tree Automata. 93-105 - Jakub Ruszil:
Some Results Concerning Careful Synchronization of Partial Automata and Subset Synchronization of DFA's. 106-115 - Laura K. Hutchinson, Robert Mercas, Daniel Reidenbach:
A Toolkit for Parikh Matrices. 116-127 - Martin Kutrib, Uwe Meyer:
Syntax Checking Either Way. 128-139 - Martin Kutrib, Andreas Malcher, Matthias Wendlandt:
On the Power of Pushing or Stationary Moves for Input-Driven Pushdown Automata. 140-151 - Michal Hospodár, Viktor Olejár:
The Cut Operation in Subclasses of Convex Languages (Extended Abstract). 152-164 - Nicholas Q. Tran:
Variations of the Separating Words Problem. 165-176 - Olga Martynova, Alexander Okhotin:
Homomorphisms on Graph-Walking Automata. 177-188 - Oliver A. S. Lyon, Kai Salomaa:
Nondeterministic State Complexity of Site-Directed Deletion. 189-199 - Öykü Yilmaz, Firat Kiyak, Meriç Üngör, A. C. Cem Say:
Energy Complexity of Regular Language Recognition. 200-211 - Özdeniz Dolu, Nevzat Ersoy, M. Utkan Gezer, A. C. Cem Say:
Real-Time, Constant-Space, Constant-Randomness Verifiers. 212-224 - Stefan Hoffmann:
Constrained Synchronization for Monotonic and Solvable Automata and Automata with Simple Idempotents. 225-237 - Yusuke Inoue, Kenji Hashimoto, Hiroyuki Seki:
An Ambiguity Hierarchy of Weighted Context-Free Grammars. 238-250
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2026-09-02 00:55 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated, funded, and maintained by:
Schloss Dagstuhl - Leibniz Center for Informatics is a member of the Leibniz Association and is funded by the federal government of Germany and the states of Germany, especially Saarland and Rhineland‑Palatinate.
