Abstract is missing.
- Green s Relations and Their Use in Automata TheoryThomas Colcombet. 1-21 [doi]
- Automatic Structures and GroupsBakhadyr Khoussainov. 22-40 [doi]
- Vector Addition System Reachability Problem: A Short Self-contained ProofJérôme Leroux. 41-64 [doi]
- Abstract Numeration SystemsNarad Rampersad. 65-79 [doi]
- Rule Formats for DistributivityLuca Aceto, Matteo Cimini, Anna Ingólfsdóttir, Mohammad Reza Mousavi, Michel A. Reniers. 80-91 [doi]
- Mutation SystemsDana Angluin, James Aspnes, Raonne Barbosa Vargas. 92-104 [doi]
- Classification of String Languages via Tiling Recognizable Picture LanguagesMarcella Anselmo, Dora Giammarresi, Maria Madonia. 105-116 [doi]
- A Simple and Efficient Universal Reversible Turing MachineHolger Bock Axelsen, Robert Glück. 117-128 [doi]
- The Parameterized Complexity of Chosen Problems for Finite Automata on TreesAgata Barecka, Witold Charatonik. 129-141 [doi]
- Recognizing Shuffled LanguagesMartin Berglund, Henrik Björklund, Johanna Högberg. 142-154 [doi]
- Unary Pattern Avoidance in Partial Words Dense with HolesFrancine Blanchet-Sadri, Kevin Black, Andrew Zemke. 155-166 [doi]
- Characterizing Compressibility of Disjoint Subgraphs with NLC GrammarsRobert Brijder, Hendrik Blockeel. 167-178 [doi]
- Partial Derivatives of an Extended Regular ExpressionPascal Caron, Jean-Marc Champarnaud, Ludovic Mignot. 179-191 [doi]
- Automatic Learning of Subclasses of Pattern LanguagesJohn Case, Sanjay Jain, Trong Dao Le, Yuh Shin Ong, Pavel Semukhin, Frank Stephan. 192-203 [doi]
- Finite Orbits of Language OperationsEmilie Charlier, Michael Domaratzki, Tero Harju, Jeffrey Shallit. 204-215 [doi]
- The Complexity of Request-Response GamesKrishnendu Chatterjee, Thomas A. Henzinger, Florian Horn. 227-237 [doi]
- Improved Alignment Based Algorithm for Multilingual Text CompressionEhud S. Conley, Shmuel Tomi Klein. 238-249 [doi]
- Singular Artin Monoids of Finite Coxeter Type Are AutomaticRuth Corran, Michael Hoffmann 0002, Dietrich Kuske, Richard M. Thomas. 250-261 [doi]
- Networks of Evolutionary Processors with Subregular FiltersJürgen Dassow, Florin Manea, Bianca Truthe. 262-273 [doi]
- Decision Problems for Interval Markov ChainsBenoît Delahaye, Kim G. Larsen, Axel Legay, Mikkel L. Pedersen, Andrzej Wasowski. 274-285 [doi]
- Classifying Regular Languages via Cascade Products of AutomataMarcus Gelderie. 286-297 [doi]
- The Block Structure of Successor MorphismsJana Hadravová. 298-309 [doi]
- Models for Quantitative Distributed Systems and Multi-Valued LogicsMartin Huschenbett. 310-322 [doi]
- A Local Greibach Normal Form for Hyperedge Replacement GrammarsChristina Jansen, Jonathan Heinen, Joost-Pieter Katoen, Thomas Noll. 323-335 [doi]
- Unique Small Subgraphs Are Not Easier to FindMiroslaw Kowaluk, Andrzej Lingas, Eva-Marta Lundell. 336-341 [doi]
- Simplifying DPDA Using Supplementary InformationPavel Labath, Branislav Rovan. 342-353 [doi]
- Normalization of Sequential Top-Down Tree-to-Word TransducersGrégoire Laurence, Aurélien Lemay, Joachim Niehren, Slawek Staworko, Marc Tommasi. 354-365 [doi]
- Planarity of Knots, Register Automata and LogSpace ComputabilityAlexei Lisitsa, Igor Potapov, Rafiq Saleh. 366-377 [doi]
- Tarski s Principle, Categorial Grammars and LearnabilityJacek Marciniec. 378-389 [doi]
- Globally Deterministic CD-Systems of Stateless R(1)-AutomataBenedek Nagy, Friedrich Otto. 390-401 [doi]
- Bit-coded Regular Expression ParsingLasse Nielsen, Fritz Henglein. 402-413 [doi]
- Descriptional Complexity of Unambiguous Nested Word AutomataAlexander Okhotin, Kai Salomaa. 414-426 [doi]
- Avalanche Structure in the Kadanoff Sand Pile ModelKevin Perrot, Eric Rémila. 427-439 [doi]
- Well-Quasi-Ordering Hereditarily Finite SetsAlberto Policriti, Alexandru I. Tomescu. 440-451 [doi]
- On the Interval-Bound Problem for Weighted Timed AutomataKarin Quaas. 452-464 [doi]
- Finding Shuffle Words That Represent Optimal Scheduling of Shared Memory AccessDaniel Reidenbach, Markus L. Schmid. 465-476 [doi]
- Syntactic Complexity of Ultimately Periodic Sets of IntegersMichel Rigo, Élise Vandomme. 477-488 [doi]
- Undecidability of the State Complexity of Composed Regular OperationsArto Salomaa, Kai Salomaa, Sheng Yu. 489-498 [doi]
- Restarting Automata with Auxiliary Symbols and Small LookaheadNatalie Schluter. 499-510 [doi]