default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID20th CIAA 2015: Umeå, Sweden
- Frank Drewes:
Implementation and Application of Automata - 20th International Conference, CIAA 2015, Umeå, Sweden, August 18-21, 2015, Proceedings. Lecture Notes in Computer Science 9223, Springer 2015, ISBN 978-3-319-22359-9
Invited Papers
- Benedikt Bollig:
Automata and Logics for Concurrent Systems: Five Models in Five Pages. 3-12 - Bruce W. Watson:
Hardware Implementations of Finite Automata and Regular Expressions - Extended Abstract. 13-17
Regular Papers
- Abhijin Adiga, Chris J. Kuhlman, Madhav V. Marathe, S. S. Ravi, Daniel J. Rosenkrantz, Richard Edwin Stearns:
Complexity of Inferring Local Transition Functions of Discrete Dynamical Systems. 21-34 - Angelo Borsotti, Luca Breveglieri, Stefano Crespi-Reghizzi, Angelo Morzenti:
From Ambiguous Regular Expressions to Deterministic Parsing Automata. 35-48 - Sabine Broda
, Sílvia Cavadas, Miguel Ferreira, Nelma Moreira:
Deciding Synchronous Kleene Algebra with Derivatives. 49-62 - Pascal Caron, Ludovic Mignot, Clément Miklarz:
On the Hierarchy of Block Deterministic Languages. 63-75 - Zhe Dang, Dmitry Dementyev, Thomas R. Fischer, William J. Hutton III:
Security of Numerical Sensors in Automata. 76-88 - Henning Fernau, Meenakshi Paramasivan, Markus L. Schmid:
Jumping Finite Automata: Characterizations and Complexity. 89-101 - Emanuele Giaquinta:
Run-Length Encoded Nondeterministic KMP and Suffix Automata. 102-113 - Hermann Gruber, Markus Holzer, Sebastian Jakobi:
More on Deterministic and Nondeterministic Finite Cover Automata - Extended Abstract. 114-126 - Vladimir V. Gusev, Marek Szykula:
On the Number of Synchronizing Colorings of Digraphs. 127-139 - Pierre-Cyrille Héam, Jean-Luc Joly:
On the Uniform Random Generation of Non Deterministic Automata Up to Isomorphism. 140-152 - Pierre-Cyrille Héam, Jean-Luc Joly:
Random Generation and Enumeration of Accessible Deterministic Real-Time Pushdown Automata. 153-164 - Stefan Hoffmann, Ludwig Staiger:
Subword Metrics for Infinite Words. 165-175 - Mans Hulden:
From Two-Way to One-Way Finite Automata - Three Regular Expression-Based Methods. 176-187 - Natalia Kushik, Nina Yevtushenko:
Describing Homing and Distinguishing Sequences for Nondeterministic Finite State Machines via Synchronizing Automata. 188-198 - Martin Kutrib, Matthias Wendlandt:
Expressive Capacity of Concatenation Freeness. 199-210 - Grzegorz Madejski:
The Membership Problem for Linear and Regular Permutation Languages. 211-223 - Masaki Nakanishi, Abuzer Yakaryilmaz:
Classical and Quantum Counter Automata on Promise Problems. 224-237 - Timothy Ng, David Rappaport, Kai Salomaa:
State Complexity of Prefix Distance. 238-249 - Daniel Prusa:
(Un)decidability of the Emptiness Problem for Multi-dimensional Context-Free Grammars. 250-262 - Mehryar Mohri, Michael D. Riley:
On the Disambiguation of Weighted Automata. 263-278 - Marek Szykula:
Checking Whether an Automaton Is Monotonic Is NP-complete. 279-291 - Martin Berglund, Brink van der Merwe:
On the Semantics of Regular Expression Parsing in the Wild. 292-304
Tool Demonstration Papers
- Abejide Ade-Ibijola, Sigrid Ewert, Ian Douglas Sanders:
Introducing Code Adviser: A DFA-driven Electronic Programming Tutor. 307-312 - Angelo Borsotti, Luca Breveglieri, Stefano Crespi-Reghizzi, Angelo Morzenti:
BSP: A Parsing Tool for Ambiguous Regular Expressions. 313-316
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-01-20 22:36 CET 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:
