Abstract is missing.
- Complexity Dichotomy for Counting ProblemsJin-yi Cai. 1-11 [doi]
- Algorithms for Analyzing and Verifying Infinite-State Recursive Probabilistic SystemsKousha Etessami. 12 [doi]
- Recursion Schemes, Collapsible Pushdown Automata and Higher-Order Model CheckingLuke Ong. 13-41 [doi]
- Discrete Linear Dynamical SystemsJoël Ouaknine. 42 [doi]
- XML Schema Management: A Challenge for Automata TheoryThomas Schwentick. 43 [doi]
- On the Complexity of Shortest Path Problems on Discounted Cost GraphsRajeev Alur, Sampath Kannan, Kevin Tian, Yifei Yuan. 44-55 [doi]
- Termination of Rule-Based Calculi for Uniform Semi-UnificationTakahito Aoto, Munehiro Iwami. 56-67 [doi]
- Deciding WQO for Factorial LanguagesAistis Atminas, Vadim V. Lozin, Mikhail Moshkov. 68-79 [doi]
- On the Construction of a Family of Automata That Are Generically Non-minimalParisa Babaali, Christopher Knaplund. 80-91 [doi]
- Limited Non-determinism Hierarchy of Counter AutomataSebastian Bala, Dariusz Jackowski. 92-103 [doi]
- Unambiguous Automata Denoting Finitely Sequential FunctionsSebastian Bala, Artur Koninski. 104-115 [doi]
- Duplication-Loss Genome Alignment: Complexity and AlgorithmBillel Benzaid, Riccardo Dondi, Nadia El-Mabrouk. 116-127 [doi]
- Maximizing Entropy over Markov ProcessesFabrizio Biondi, Axel Legay, Bo Friis Nielsen, Andrzej Wasowski. 128-140 [doi]
- MAT Learning of Universal AutomataJohanna Björklund, Henning Fernau, Anna Kasprzik. 141-152 [doi]
- A Graph Polynomial Approach to PrimitivityFrancine Blanchet-Sadri, Michelle Bodnar, Nathan Fox, Joe Hidakatsu. 153-164 [doi]
- Suffix Trees for Partial Words and the Longest Common Compatible Prefix ProblemFrancine Blanchet-Sadri, Justin Lazarow. 165-176 [doi]
- Dynamic Communicating Automata and Branching High-Level MSCsBenedikt Bollig, Aiswarya Cyriac, Loïc Hélouët, Ahmet Kara, Thomas Schwentick. 177-189 [doi]
- Visibly Pushdown Automata: Universality and Inclusion via AntichainsVéronique Bruyère, Marc Ducobu, Olivier Gauwin. 190-201 [doi]
- Two-Sided Derivatives for Regular Expressions and for Hairpin ExpressionsJean-Marc Champarnaud, Jean-Philippe Dubernard, Hadrien Jeanne, Ludovic Mignot. 202-213 [doi]
- How to Travel between LanguagesKrishnendu Chatterjee, Siddhesh Chaubal, Sasha Rubin. 214-225 [doi]
- Execution Information Rate for Some Classes of AutomataCewei Cui, Zhe Dang, Thomas R. Fischer, Oscar H. Ibarra. 226-237 [doi]
- Decidability and Complexity Results for Verification of Asynchronous Broadcast NetworksGiorgio Delzanno, Riccardo Traverso. 238-249 [doi]
- The Buffered π-Calculus: A Model for Concurrent LanguagesXiaojie Deng, Yu Zhang, Yuxin Deng, Farong Zhong. 250-261 [doi]
- Mix-Automatic SequencesJörg Endrullis, Clemens Grabmayer, Dimitri Hendriks. 262-274 [doi]
- A Multivariate Analysis of Some DFA ProblemsHenning Fernau, Pinar Heggernes, Yngve Villanger. 275-286 [doi]
- On the Size Complexity of Deterministic Frequency AutomataRusins Freivalds, Thomas Zeugmann, Grant R. Pogosyan. 287-298 [doi]
- On the Number of Unbordered FactorsDaniel Goc, Hamoon Mousavi, Jeffrey Shallit. 299-310 [doi]
- Primitive Words and Lyndon Words in Automatic and Linearly Recurrent SequencesDaniel Goc, Kalle Saari, Jeffrey Shallit. 311-322 [doi]
- Efficient Submatch Extraction for Practical Regular ExpressionsStuart Haber, William Horne, Pratyusa K. Manadhata, Miranda Mowbray, Prasad Rao. 323-334 [doi]
- Determinacy and Subsumption for Single-Valued Bottom-Up Tree TransducersKenji Hashimoto, Ryuta Sawada, Yasunori Ishihara, Hiroyuki Seki, Toru Fujiwara. 335-346 [doi]
- Revealing vs. Concealing: More Simulation Games for Büchi InclusionMilka Hutagalung, Martin Lange, Étienne Lozes. 347-358 [doi]
- On Bounded Languages and Reversal-Bounded AutomataOscar H. Ibarra, Bala Ravikumar. 359-370 [doi]
- Rewrite Closure and CF Hedge AutomataFlorent Jacquemard, Michaël Rusinowitch. 371-382 [doi]
- Linear-Time Version of Holub's Algorithm for Morphic Imprimitivity TestingTomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen. 383-394 [doi]
- From Regular Tree Expression to Position Tree AutomatonÉric Laugerotte, Nadia Ouali Sebti, Djelloul Ziadi. 395-406 [doi]
- Convergence of Newton's Method over Commutative SemiringsMichael Luttenberger, Maximilian Schlund. 407-418 [doi]
- Counting Minimal Symmetric Difference NFAsBrink van der Merwe, Mark Farag, Jaco Geldenhuys. 419-430 [doi]
- Interval Logics and ωB-Regular LanguagesAngelo Montanari, Pietro Sala. 431-443 [doi]
- Eliminating Stack Symbols in Push-Down Automata and Linear Indexed GrammarsKatsuhiko Nakamura, Keita Imada. 444-455 [doi]
- Asynchronous PC Systems of Pushdown AutomataFriedrich Otto. 456-467 [doi]
- Model Checking Metric Temporal Logic over Automata with One CounterKarin Quaas. 468-479 [doi]
- Coinductive Proof Techniques for Language EquivalenceJurriaan Rot, Marcello M. Bonsangue, Jan J. M. M. Rutten. 480-492 [doi]
- Ostrowski Numeration and the Local Period of Sturmian WordsLuke Schaeffer. 493-503 [doi]
- Boolean Algebras of Regular ω-LanguagesVictor L. Selivanov, Anton Konovalov. 504-515 [doi]
- Pumping, Shrinking and Pronouns: From Context Free to Indexed GrammarsEli Shamir. 516-522 [doi]
- Online Matching of Multiple Regular Patterns with Gaps and Character ClassesSeppo Sippu, Eljas Soisalon-Soininen. 523-534 [doi]
- Infiniteness and Boundedness in 0L, DT0L, and T0L SystemsTim Smith. 535-546 [doi]
- Uniformisation of Two-Way TransducersRodrigo de Souza. 547-558 [doi]
- A Conditional Superpolynomial Lower Bound for Extended ResolutionOlga Tveretina. 559-569 [doi]
- A Turing Machine Distance HierarchyStanislav Zák, Jirí Síma. 570-578 [doi]