Abstract is missing.
- FPsolve: A Generic Solver for Fixpoint Equations over SemiringsJavier Esparza, Michael Luttenberger, Maximilian Schlund. 1-15 [doi]
- Restarting Automata for Picture Languages: A Survey on Recent DevelopmentsFriedrich Otto. 16-41 [doi]
- Investigations on Automata and Languages over a Unary AlphabetGiovanni Pighizzini. 42-57 [doi]
- Cellular Automata for Crowd DynamicsGeorgios Ch. Sirakoulis. 58-69 [doi]
- Counting Equivalent Linear Finite Transducers Using a Canonical FormIvone Amorim, António Machiavelo, Rogério Reis. 70-83 [doi]
- On the Power of One-Way Automata with Quantum and Classical StatesMaria Paola Bianchi, Carlo Mereghetti, Beatrice Palano. 84-97 [doi]
- On Comparing Deterministic Finite Automata and the Shuffle of WordsFranziska Biegler, Ian McQuillan. 98-109 [doi]
- Minimal Partial Languages and AutomataFrancine Blanchet-Sadri, Kira Goldner, Aidan Shackleton. 110-123 [doi]
- Large Aperiodic SemigroupsJanusz A. Brzozowski, Marek Szykula. 124-135 [doi]
- On the Square of Regular LanguagesKristína Cevorová, Galina Jirásková, Ivana Krajnáková. 136-147 [doi]
- Unary Languages Recognized by Two-Way One-Counter AutomataMarzio De Biasi, Abuzer Yakaryilmaz. 148-161 [doi]
- A Type System for Weighted Automata and Rational ExpressionsAkim Demaille, Alexandre Duret-Lutz, Sylvain Lombardy, Luca Saiu, Jacques Sakarovitch. 162-175 [doi]
- Bounded Prefix-Suffix DuplicationMarius Dumitran, Javier Gil, Florin Manea, Victor Mitrana. 176-187 [doi]
- Recognition of Labeled Multidigraphs by Spanning Tree AutomataAkio Fujiyoshi. 188-199 [doi]
- Reset Thresholds of Automata with Two Cycle LengthsVladimir V. Gusev, Elena V. Pribavkina. 200-210 [doi]
- On the Ambiguity, Finite-Valuedness, and Lossiness Problems in Acceptors and TransducersOscar H. Ibarra. 211-225 [doi]
- Kleene Closure on Regular and Prefix-Free LanguagesGalina Jirásková, Matús Palmovský, Juraj Sebej. 226-237 [doi]
- Left is Better than Right for Reducing Nondeterminism of NFAsSang-Ki Ko, Yo-Sub Han. 238-251 [doi]
- Analytic Functions Computable by Finite State TransducersPetr Kurka, Tomás Vávra. 252-263 [doi]
- Partial Derivative and Position Bisimilarity AutomataEva Maia, Nelma Moreira, Rogério Reis. 264-277 [doi]
- The Power of Regularity-Preserving Multi Bottom-up Tree TransducersAndreas Maletti. 278-289 [doi]
- Pushdown Machines for Weighted Context-Free Tree TranslationJohannes Osterholzer. 290-303 [doi]
- Weighted Variable Automata over Infinite AlphabetsMaria Pittou, George Rahonis. 304-317 [doi]
- Implications of Quantum Automata for ContextualityJibran Rashid, Abuzer Yakaryilmaz. 318-331 [doi]
- Pairwise Rational Kernels Obtained by Automaton OperationsAbiel Roche-Lima, Michael Domaratzki, Brian Fristensky. 332-345 [doi]