Abstract is missing.
- Context-Free Ambiguity Detection Using Multi-stack Pushdown AutomataHendrikus J. S. Basten. 1-12 [doi]
- Complementation of Branching Automata for Scattered and Countable Series-Parallel PosetsNicolas Bedon. 13-25 [doi]
- Cayley Automatic Groups and Numerical Characteristics of Turing TransducersDmitry Berdinsky. 26-37 [doi]
- A Perfect Class of Context-Sensitive Timed LanguagesDevendra Bhave, Vrunda Dave, Shankara Narayanan Krishna, Ramchandra Phawade, Ashutosh Trivedi. 38-50 [doi]
- Position Automaton Construction for Regular Expressions with IntersectionSabine Broda, António Machiavelo, Nelma Moreira, Rogério Reis. 51-63 [doi]
- A Language-Theoretical Approach to Descriptive ComplexityMichaël Cadilhac, Andreas Krebs, Klaus-Jörn Lange. 64-76 [doi]
- k-Abelian Equivalence and RationalityJulien Cassaigne, Juhani Karhumäki, Svetlana Puzynina, Markus A. Whiteland. 77-88 [doi]
- Schützenberger Products in a CategoryLiang-Ting Chen, Henning Urbat. 89-101 [doi]
- Outfix-Guided Insertion - (Extended Abstract)Da-Jung Cho, Yo-Sub Han, Timothy Ng 0001, Kai Salomaa. 102-113 [doi]
- Both Ways Rational FunctionsChristian Choffrut, Bruno Guillon. 114-124 [doi]
- Aperiodic String TransducersLuc Dartois, Ismaël Jecker, Pierre-Alain Reynier. 125-137 [doi]
- An Automata Characterisation for Multiple Context-Free LanguagesTobias Denkinger. 138-150 [doi]
- Weighted Automata and Logics on Infinite GraphsStefan Dück. 151-163 [doi]
- Degrees of Infinite Words, Polynomials and AtomsJörg Endrullis, Juhani Karhumäki, Jan Willem Klop, Aleksi Saarela. 164-176 [doi]
- Ternary Square-Free Partial Words with Many WildcardsDaniil Gasnikov, Arseny M. Shur. 177-189 [doi]
- Alternating Demon Space Is Closed Under Complement and Other Simulations for Sublogarithmic SpaceViliam Geffert. 190-202 [doi]
- Weighted Symbolic Automata with Data StorageLuisa Herrmann, Heiko Vogler. 203-215 [doi]
- On Families of Full Trios Containing Counter Machine LanguagesOscar H. Ibarra, Ian McQuillan. 216-228 [doi]
- Non-regular Maximal Prefix-Free Subsets of Regular LanguagesJozef Jirásek Jr.. 229-242 [doi]
- Operations on Unambiguous Finite AutomataJozef Jirásek Jr., Galina Jirásková, Juraj Sebej. 243-255 [doi]
- The Trace Monoids in the Queue Monoid and in the Direct Product of Two Free MonoidsDietrich Kuske, Olena Prianychnykova. 256-267 [doi]
- On Ordered RRWW-AutomataKent Kwee, Friedrich Otto. 268-279 [doi]
- Bispecial Factors in the Brun S-Adic SystemSébastien Labbé, Julien Leroy. 280-292 [doi]
- Compositions of Tree-to-Tree Statistical Machine Translation ModelsAndreas Maletti. 293-305 [doi]
- On the Solvability Problem for Restricted Classes of Word EquationsFlorin Manea, Dirk Nowotka, Markus L. Schmid. 306-318 [doi]
- Unambiguous Büchi Is WeakHenryk Michalewski, Michal Skrzypczak. 319-331 [doi]
- One-Unknown Word Equations and Three-Unknown Constant-Free Word EquationsDirk Nowotka, Aleksi Saarela. 332-343 [doi]
- Avoidability of Formulas with Two VariablesPascal Ochem, Matthieu Rosenfeld. 344-354 [doi]
- Deciding Equivalence of Linear Tree-to-Word Transducers in Polynomial TimeAdrien Boiret, Raphaela Palenta. 355-367 [doi]
- On Finite and Polynomial Ambiguity of Weighted Tree AutomataErik Paul. 368-379 [doi]
- An Extremal Series of Eulerian Synchronizing AutomataMarek Szykula, Vojtech Vorel. 380-392 [doi]
- Monoid-Based Approach to the Inclusion Problem on Superdeterministic Pushdown AutomataYuya Uezato, Yasuhiko Minamide. 393-405 [doi]