Abstract is missing.
- Automata and Logics for Concurrent Systems: Five Models in Five PagesBenedikt Bollig. 3-12 [doi]
- Hardware Implementations of Finite Automata and Regular Expressions - Extended AbstractBruce W. Watson. 13-17 [doi]
- Complexity of Inferring Local Transition Functions of Discrete Dynamical SystemsAbhijin Adiga, Chris J. Kuhlman, Madhav V. Marathe, S. S. Ravi, Daniel J. Rosenkrantz, Richard Edwin Stearns. 21-34 [doi]
- From Ambiguous Regular Expressions to Deterministic Parsing AutomataAngelo Borsotti, Luca Breveglieri, Stefano Crespi-Reghizzi, Angelo Morzenti. 35-48 [doi]
- Deciding Synchronous Kleene Algebra with DerivativesSabine Broda, Sílvia Cavadas, Miguel Ferreira, Nelma Moreira. 49-62 [doi]
- On the Hierarchy of Block Deterministic LanguagesPascal Caron, Ludovic Mignot, Clément Miklarz. 63-75 [doi]
- Security of Numerical Sensors in AutomataZhe Dang, Dmitry Dementyev, Thomas R. Fischer, William J. Hutton III. 76-88 [doi]
- Jumping Finite Automata: Characterizations and ComplexityHenning Fernau, Meenakshi Paramasivan, Markus L. Schmid. 89-101 [doi]
- Run-Length Encoded Nondeterministic KMP and Suffix AutomataEmanuele Giaquinta. 102-113 [doi]
- More on Deterministic and Nondeterministic Finite Cover Automata - Extended AbstractHermann Gruber, Markus Holzer, Sebastian Jakobi. 114-126 [doi]
- On the Number of Synchronizing Colorings of DigraphsVladimir V. Gusev, Marek Szykula. 127-139 [doi]
- On the Uniform Random Generation of Non Deterministic Automata Up to IsomorphismPierre-Cyrille Héam, Jean-Luc Joly. 140-152 [doi]
- Random Generation and Enumeration of Accessible Deterministic Real-Time Pushdown AutomataPierre-Cyrille Héam, Jean-Luc Joly. 153-164 [doi]
- Subword Metrics for Infinite WordsStefan Hoffmann, Ludwig Staiger. 165-175 [doi]
- From Two-Way to One-Way Finite Automata - Three Regular Expression-Based MethodsMans Hulden. 176-187 [doi]
- Describing Homing and Distinguishing Sequences for Nondeterministic Finite State Machines via Synchronizing AutomataNatalia Kushik, Nina Yevtushenko. 188-198 [doi]
- Expressive Capacity of Concatenation FreenessMartin Kutrib, Matthias Wendlandt. 199-210 [doi]
- The Membership Problem for Linear and Regular Permutation LanguagesGrzegorz Madejski. 211-223 [doi]
- Classical and Quantum Counter Automata on Promise ProblemsMasaki Nakanishi, Abuzer Yakaryilmaz. 224-237 [doi]
- State Complexity of Prefix DistanceTimothy Ng, David Rappaport, Kai Salomaa. 238-249 [doi]
- (Un)decidability of the Emptiness Problem for Multi-dimensional Context-Free GrammarsDaniel Prusa. 250-262 [doi]
- On the Disambiguation of Weighted AutomataMehryar Mohri, Michael D. Riley. 263-278 [doi]
- Checking Whether an Automaton Is Monotonic Is NP-completeMarek Szykula. 279-291 [doi]
- On the Semantics of Regular Expression Parsing in the WildMartin Berglund, Brink van der Merwe. 292-304 [doi]
- Introducing Code Adviser: A DFA-driven Electronic Programming TutorAbejide Ade-Ibijola, Sigrid Ewert, Ian Douglas Sanders. 307-312 [doi]
- BSP: A Parsing Tool for Ambiguous Regular ExpressionsAngelo Borsotti, Luca Breveglieri, Stefano Crespi-Reghizzi, Angelo Morzenti. 313-316 [doi]