default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID29th CIAA 2025: Palermo, Italy
- Giuseppa Castiglione
, Sabrina Mantaci:
Implementation and Application of Automata - 29th International Conference, CIAA 2025, Palermo, Italy, September 22-25, 2025, Proceedings. Lecture Notes in Computer Science 15981, Springer 2026, ISBN 978-3-032-02601-9 - Franziska Alber, Philipp Rümmer:
Complementable Normal Form of Parametrized Automata. 1-14 - Samira Attou, Ludovic Mignot, Clément Miklarz, Florent Nicart:
Toward the Glushkovization of Automata: The Strong Stabilization. 15-26 - Martin Berglund, Anna Jonsson, Willeke Martens, Brink van der Merwe:
Constructing Compact BPE Token DFAs. 27-40 - Bernard Boigelot, Thomas Braipson, Tom Clara:
Epsilon Automata on Linear Orderings. 41-54 - Angelo Borsotti, Luca Breveglieri, Stefano Crespi-Reghizzi, Angelo Morzenti:
Multi-entry DFA with Reduced Initial States to Speedup Parallel Recognition. 55-72 - Alessandro Clerici Lorenzini, Giovanni Pighizzini, Luca Prigioniero:
Two-Way Automata and Bounded Languages. 73-85 - Zhibo Deng, Tianxiang Tang, Vladimir A. Zakharov:
An Algebraic Approach to the Equivalence Checking of Deterministic Top-down Tree Transducers. 86-98 - Simon Dieck, Sicco Verwer:
An Active Learning Algorithm for Bidirectional Deterministic Finite Automata. 99-114 - Frank Drewes, Marco Kuhlmann, Olle Torstensson:
Dynamically Weighted Tree Transducers. 115-128 - Alexandre Duret-Lutz, Shufang Zhu, Nir Piterman, Giuseppe De Giacomo, Moshe Y. Vardi:
Engineering an LTLf Synthesis Tool. 129-147 - Szilárd Zsolt Fazekas, Béla Klein, Tore Koß, Florin Manea, Robert Mercas, Timo Specht:
Subsequence Matching and Analysis Problems for Automata with Translucent Letters. 148-164 - Paul Gallot, Sebastian Maneth:
Shape Preserving Tree Transducers. 165-179 - Viliam Geffert, Alexander Okhotin:
Simulating Two-Way Nondeterministic Finite Automata Over Small Alphabets by One-Way Nondeterministic Automata. 180-192 - Roland Herrmann, Philipp Rümmer:
A New Approach for Showing Termination of Parameterized Transition Systems. 193-207 - Maurice Herwig, Norbert Hundeshagen, Martin Lange:
An Earley-Based Universal Error-Correcting Parser. 208-222 - Markus Holzer, Christian Rauch:
More on Language Families with a Decidable Pumping-Problem (Extended Abstract). 223-236 - Mazen Khodier, Luke Schaeffer, Jeffrey O. Shallit:
Self-verifying Predicates in Büchi Arithmetic. 237-251 - Martin Kutrib, Andreas Malcher, Priscilla Raucci:
State-Freezing Pushdown Automata. 252-266 - Olga Martynova, Alexander Okhotin:
From Regular Expressions to Deterministic Finite Automata: $2^{\frac{n}{2}+\sqrt{n}(\log n)^{\varTheta (1)}}$ States Are Necessary and Sufficient. 267-280 - Thomas Place, Marc Zeitoun:
A First Taste of MeSCaL, a Tool for Solving Membership Problems for Regular Languages. 281-298 - Thomas Place, Marc Zeitoun:
In Orbit with MeSCaL: Higher in Concatenation and Navigational Hierarchies of Regular Languages. 299-315 - Maria Radionova, Alexander Okhotin:
A Hierarchy of Reversible Finite Automata. 316-329
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 2025-10-12 22:03 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 and maintained by:
the dblp computer science bibliography is funded and supported by:
