Abstract is missing.
- Binary Coded Unary Regular LanguagesViliam Geffert. 3-20 [doi]
- A Survey on Automata with Translucent LettersFriedrich Otto. 21-50 [doi]
- Earliest Query Answering for Deterministic Stepwise Hedge AutomataAntonio Al Serhali, Joachim Niehren. 53-65 [doi]
- Constrained Multi-TildesSamira Attou, Ludovic Mignot, Clément Miklarz, Florent Nicart. 66-78 [doi]
- On the Smallest Synchronizing Terms of Finite Tree AutomataVáclav Blazej, Jan Janousek, Stepán Plachý. 79-90 [doi]
- Universal First-Order Quantification over AutomataBernard Boigelot, Pascal Fontaine, Baptiste Vergain. 91-102 [doi]
- Average Complexity of Partial Derivatives for Synchronised Shuffle ExpressionsSabine Broda, António Machiavelo, Nelma Moreira, Rogério Reis. 103-115 [doi]
- Sweep Complexity RevisitedSzilárd Zsolt Fazekas, Robert Mercas. 116-127 [doi]
- The Pumping Lemma for Regular Languages is HardHermann Gruber, Markus Holzer 0001, Christian Rauch. 128-140 [doi]
- M-equivalence of Parikh Matrix over a Ternary AlphabetJoonghyuk Hahn, Hyunjoon Cheon, Yo-Sub Han. 141-152 [doi]
- Operational Complexity in Subregular ClassesMichal Hospodár, Galina Jirásková. 153-165 [doi]
- When Is Context-Freeness Distinguishable from Regularity? an Extension of Parikh's TheoremYusuke Inoue, Kenji Hashimoto, Hiroyuki Seki. 166-178 [doi]
- Enhanced Ternary Fibonacci CodesShmuel T. Klein, Dana Shapira. 179-193 [doi]
- Sweeping Input-Driven Pushdown AutomataMartin Kutrib. 194-205 [doi]
- Verified Verifying: SMT-LIB for Strings in IsabelleKevin Lotz, Mitja Kulczynski, Dirk Nowotka, Danny Bøgsted Poulsen, Anders Schlichtkrull. 206-217 [doi]
- Weighted Bottom-Up and Top-Down Tree Transformations Are IncomparableAndreas Maletti, Andreea-Teodora Nász. 218-229 [doi]
- Deciding Whether an Attributed Translation Can Be Realized by a Top-Down TransducerSebastian Maneth, Martin Vu. 230-241 [doi]
- A Time to Cast Away StonesOlga Martynova 0001, Alexander Okhotin. 242-253 [doi]
- Two-Way Machines and de Bruijn WordsGiovanni Pighizzini, Luca Prigioniero. 254-265 [doi]
- Transduction of Automatic Sequences and ApplicationsJeffrey O. Shallit, Anatoly Zavyalov. 266-277 [doi]
- Measuring Power of Generalised Definite LanguagesRyoma Sin'ya. 278-289 [doi]
- Smaller Representation of Compiled Regular ExpressionsSicheol Sung, Sang-Ki Ko, Yo-Sub Han. 290-301 [doi]