Abstract is missing.
- Decision Problems for Finite Automata over Infinite Algebraic StructuresBakhadyr Khoussainov, Jiamou Liu. 3-11 [doi]
- The Degree of Irreversibility in Deterministic Finite AutomataHolger Bock Axelsen, Markus Holzer 0001, Martin Kutrib. 15-26 [doi]
- Deterministic Stack TransducersSuna Bensch, Johanna Björklund, Martin Kutrib. 27-38 [doi]
- Computing the Expected Edit Distance from a String to a PFAJorge Calvo-Zaragoza, Colin de la Higuera, José Oncina. 39-50 [doi]
- Derived-Term Automata of Multitape Rational ExpressionsAkim Demaille. 51-63 [doi]
- Solving Parity Games Using an Automata-Based AlgorithmAntonio Di Stasio, Aniello Murano, Giuseppe Perelli, Moshe Y. Vardi. 64-76 [doi]
- Ternary Equational LanguagesZoltán Ésik. 77-88 [doi]
- Problems on Finite Automata and the Exponential Time HypothesisHenning Fernau, Andreas Krebs. 89-100 [doi]
- A Practical Algorithm for the Uniform Membership Problem of Labeled Multidigraphs of Tree-Width 2 for Spanning Tree AutomataAkio Fujiyoshi. 101-112 [doi]
- A Practical Simulation Result for Two-Way Pushdown AutomataRobert Glück. 113-124 [doi]
- Nondeterministic Complexity of Operations on Closed and Ideal LanguagesMichal Hospodár, Galina Jirásková, Peter Mlynárcik. 125-137 [doi]
- On Bounded Semilinear Languages, Counter Machines, and Finite-Index ET0LOscar H. Ibarra, Ian McQuillan. 138-149 [doi]
- Kuratowski Algebras Generated by Prefix-Free LanguagesJozef Jirásek Jr., Juraj Sebej. 150-162 [doi]
- A Logical Characterization of Small 2NFAsChristos A. Kapoutsis, Lamana Mulaffer. 163-175 [doi]
- Experiments with Synchronizing AutomataAndrzej Kisielewicz, Jakub Kowalski, Marek Szykula. 176-188 [doi]
- Implementation of Code Properties via TransducersStavros Konstantinidis, Casey Meijer, Nelma Moreira, Rogério Reis. 189-201 [doi]
- On Synchronizing Automata and Uniform DistributionEmil Lerner. 202-212 [doi]
- Looking for Pairs that Hard to Separate: A Quantum ApproachAleksandrs Belovs, J. Andres Montoya, Abuzer Yakaryilmaz. 213-223 [doi]
- Prefix Distance Between Regular LanguagesTimothy Ng. 224-235 [doi]
- Complexity of Sets of Two-Dimensional PatternsDaniel Prusa. 236-247 [doi]
- The Complexity of Fixed-Height Patterned Tile Self-assemblyShinnosuke Seki, Andrew Winslow. 248-259 [doi]
- Derivative-Based Diagnosis of Regular Expression AmbiguityMartin Sulzmann, Kenny Zhuo Ming Lu. 260-272 [doi]
- Regular Approximation of Weighted Linear Nondeleting Context-Free Tree LanguagesMarkus Teichmann. 273-284 [doi]
- Derivatives for Enhanced Regular ExpressionsPeter Thiemann. 285-297 [doi]
- Weighted Restarting Automata as Language AcceptorsQichao Wang, Friedrich Otto. 298-309 [doi]
- Enhancing Practical TAG Parsing Efficiency by Capturing RedundancyJakub Waszczuk, Agata Savary, Yannick Parmentier. 310-321 [doi]
- Analyzing Matching Time Behavior of Backtracking Regular Expression Matchers by Using Ambiguity of NFANicolaas Weideman, Brink van der Merwe, Martin Berglund, Bruce Watson. 322-334 [doi]