Abstract is missing.
- Information Distance and Its ApplicationsMing Li. 1-9 [doi]
- Theory Inspired by Gene Assembly in CiliatesGrzegorz Rozenberg. 10 [doi]
- On the State Complexity of Combined OperationsSheng Yu. 11-22 [doi]
- Path-Equivalent Removals of ::::epsilon::::-transitions in a Genomic Weighted Finite AutomatonMathieu Giraud, Philippe Veber, Dominique Lavenier. 23-33 [doi]
- Hybrid Extended Finite AutomataHenning Bordihn, Markus Holzer, Martin Kutrib. 34-45 [doi]
- Refinement of Near Random Access Video Coding with Weighted Finite AutomataGerman Tischler. 46-57 [doi]
- Borders and Finite AutomataMartin Simunek, Borivoj Melichar. 58-68 [doi]
- Finding Common Motifs with Gaps Using Finite AutomataPavlos Antoniou, Jan Holub, Costas S. Iliopoulos, Borivoj Melichar, Pierre Peterlongo. 69-77 [doi]
- Factor OraclesMaxime Crochemore, Lucian Ilie, Emine Seid-Hilmi. 78-89 [doi]
- Reducing Simple Grammars: Exponential Against Highly-Polynomial Time in PracticeCédric Bastien, Jurek Czyzowicz, Wojciech Fraczak, Wojciech Rytter. 90-101 [doi]
- Tiburon: A Weighted Tree Automata ToolkitJonathan May, Kevin Knight. 102-113 [doi]
- Around Hopcroft s AlgorithmManuel Baclet, Claire Pagetti. 114-125 [doi]
- Multi-tape Automata with Symbol ClassesFlorent Nicart, Jean-Marc Champarnaud, Tibor Csáki, Tamás Gaál, André Kempe. 126-136 [doi]
- On the Computation of Some Standard Distances Between Probabilistic AutomataCorinna Cortes, Mehryar Mohri, Ashish Rastogi. 137-149 [doi]
- Does o-Substitution Preserve Recognizability?Andreas Maletti. 150-161 [doi]
- Correctness Preservation and Complexity of Simple RL-AutomataHartmut Messerschmidt, Frantisek Mráz, Friedrich Otto, Martin Plátek. 162-172 [doi]
- Bisimulation Minimization of Tree AutomataParosh Aziz Abdulla, Lisa Kaati, Johanna Högberg. 173-185 [doi]
- Forgetting Automata and Unary LanguagesJens Glöckler. 186-197 [doi]
- Structurally Unambiguous Finite AutomataHing Leung. 198-207 [doi]
- Symbolic Implementation of Alternating AutomataRoderick Bloem, Alessandro Cimatti, Ingo Pill, Marco Roveri, Simone Semprini. 208-218 [doi]
- On-the-Fly Branching Bisimulation Minimization for Compositional AnalysisYung-Pin Cheng, Hong-Yi Wang, Yu-Ru Cheng. 219-229 [doi]
- Finite-State Temporal ProjectionTim Fernando. 230-241 [doi]
- Compiling Linguistic Constraints into Finite State AutomataMatthieu Constant, Denis Maurel. 242-252 [doi]
- Shift-Resolve Parsing: Simple, Unbounded Lookahead, Linear TimeJosé Fortes Gálvez, Sylvain Schmitz, Jacques Farré. 253-264 [doi]
- A Family of Algorithms for Non Deterministic Regular Languages InferenceManuel Vazquez de Parga, Pedro García, José Ruiz. 265-274 [doi]
- XSLT Version 2.0 Is Turing-Complete: A Purely Transformation Based ProofRuhsan Onder, Zeki Bayram. 275-276 [doi]
- A Finite Union of DFAs in Symbolic Model Checking of Infinite SystemsSuman Roy, Bhaskar Chakraborty. 277-278 [doi]
- Universality of Hybrid Quantum Gates and Synthesis Without Ancilla QuditsGuowu Yang, Fei Xie, Xiaoyu Song, Marek A. Perkowski. 279-280 [doi]
- Reachability Analysis of Procedural Programs with Affine Integer ArithmeticMichael Luttenberger. 281-282 [doi]
- Lexical Disambiguation with Polarities and AutomataGuillaume Bonfante, Joseph Le Roux, Guy Perrier. 283-284 [doi]
- Parsing Computer Languages with an Automaton Compiled from a Single Regular ExpressionAdrian D. Thurston. 285-286 [doi]
- Tighter Packed Bit-Parallel NFA for Approximate String MatchingHeikki Hyyrö. 287-289 [doi]