Abstract is missing.
- Spiking Neural P Systems Used as Acceptors and TransducersGheorghe Paun. 1-4 [doi]
- Linear-Time Model Checking: Automata Theory in PracticeMoshe Y. Vardi. 5-10 [doi]
- OpenFst: A General and Efficient Weighted Finite-State Transducer LibraryCyril Allauzen, Michael Riley, Johan Schalkwyk, Wojciech Skut, Mehryar Mohri. 11-23 [doi]
- Automata Applications in Chip-Design SoftwareBruce W. Watson. 24-26 [doi]
- Synchronizing Automata Preserving a Chain of Partial OrdersMikhail V. Volkov. 27-37 [doi]
- Reducing Acyclic Cover TransducersJean-Marc Champarnaud, Franck Guingne, Jacques Farré. 38-50 [doi]
- On-the-Fly Stuttering in the Construction of Deterministic ::::omega:::: -AutomataJoachim Klein, Christel Baier. 51-61 [doi]
- Average Value and Variance of Pattern Statistics in Rational ModelsMassimiliano Goldwurm, Roberto Radicioni. 62-72 [doi]
- Weighted Automata and Weighted Logics with DiscountingManfred Droste, George Rahonis. 73-84 [doi]
- Regulated Nondeterminism in Pushdown AutomataMartin Kutrib, Andreas Malcher, Larissa Werlein. 85-96 [doi]
- Deterministic Caterpillar ExpressionsKai Salomaa, Sheng Yu, Jinfeng Zan. 97-108 [doi]
- Backward and Forward Bisimulation Minimisation of Tree AutomataJohanna Högberg, Andreas Maletti, Jonathan May. 109-121 [doi]
- An Implementation of Deterministic Tree Automata MinimizationRafael C. Carrasco, Jan Daciuk, Mikel L. Forcada. 122-129 [doi]
- Accelerating Boyer Moore Searches on Binary TextsShmuel Tomi Klein, Miri Ben-Nissan. 130-143 [doi]
- On the Suffix Automaton with MismatchesMaxime Crochemore, Chiara Epifanio, Alessandra Gabriele, Filippo Mignosi. 144-156 [doi]
- On String Matching in Chunked TextsHannu Peltola, Jorma Tarhio. 157-167 [doi]
- Factor Automata of Automata and ApplicationsMehryar Mohri, Pedro Moreno, Eugene Weinstein. 168-179 [doi]
- Subset Seed AutomatonGregory Kucherov, Laurent Noé, Mikhail A. Roytberg. 180-191 [doi]
- A Measure for the Degree of Nondeterminism of Context-Free LanguagesFrantisek Mráz, Martin Plátek, Friedrich Otto. 192-202 [doi]
- Efficient Computation of Throughput Values of Context-Free LanguagesDidier Caucal, Jurek Czyzowicz, Wojciech Fraczak, Wojciech Rytter. 203-213 [doi]
- Analyzing Ambiguity of Context-Free GrammarsClaus Brabrand, Robert Giegerich, Anders Møller. 214-225 [doi]
- Efficient Enumeration of Regular LanguagesMargareta Ackerman, Jeffrey Shallit. 226-242 [doi]
- Multi-grain RelationsFrançois Barthélemy. 243-252 [doi]
- Memory Reduction for Strategies in Infinite GamesMichael Holtmann, Christof Löding. 253-264 [doi]
- Syntax-Directed Translations and Quasi-alphabetic Tree BimorphismsMagnus Steinby, Catalin Ionut Tîrnauca. 265-276 [doi]
- Finite State Automata Representing Two-Dimensional SubshiftsNatasa Jonoska, Joni Burnette Pirnot. 277-289 [doi]
- Tiling Automaton: A Computational Model for Recognizable Two-Dimensional LanguagesMarcella Anselmo, Dora Giammarresi, Maria Madonia. 290-302 [doi]
- : A Library to Randomly and Exhaustively Generate AutomataFrédérique Bassino, Julien David, Cyril Nicaud. 303-305 [doi]
- A Finite-State Super-ChunkerOlivier Blanc, Matthieu Constant, Patrick Watrin. 306-308 [doi]
- The Constrained Longest Common Subsequence Problem for Degenerate StringsCostas S. Iliopoulos, M. Sohel Rahman, Michal Vorácek, Ladislav Vagner. 309-311 [doi]
- Finite Automata Accepting Star-Connected LanguagesBarbara Klunder. 312-313 [doi]
- Efficiently Matching with Local Grammars Using Prefix Overlay TransducersClemens Marschner. 314-316 [doi]
- Significant Subpatterns MatchingJan Supol. 317-319 [doi]
- A New Method for Compiling Parallel Replacement RulesAnssi Yli-Jyrä, Kimmo Koskenniemi. 320-321 [doi]