Front Matter ....Pages I-XI
On Design and Analysis of Chemical Reaction Network Algorithms (Anne Condon)....Pages 1-3
Regular Expressions and Transducers over Alphabet-Invariant and User-Defined Labels (Stavros Konstantinidis, Nelma Moreira, Rogério Reis, Joshua Young)....Pages 4-27
Boosting Pushdown and Queue Machines by Preprocessing (Martin Kutrib, Andreas Malcher, Matthias Wendlandt)....Pages 28-40
The Validity of Weighted Automata (Sylvain Lombardy, Jacques Sakarovitch)....Pages 41-45
Algorithms for Weighted Finite Automata with Failure Transitions (Cyril Allauzen, Michael D. Riley)....Pages 46-58
The Bottom-Up Position Tree Automaton and Its Compact Version (Samira Attou, Ludovic Mignot, Djelloul Ziadi)....Pages 59-70
A New Hierarchy for Automaton Semigroups (Laurent Bartholdi, Thibault Godin, Ines Klimann, Matthieu Picantin)....Pages 71-83
Synchronizing Random Almost-Group Automata (Mikhail V. Berlinkov, Cyril Nicaud)....Pages 84-96
A Comparison of Two N-Best Extraction Methods for Weighted Tree Automata (Johanna Björklund, Frank Drewes, Anna Jonsson)....Pages 97-108
State Complexity of Overlap Assembly (Janusz A. Brzozowski, Lila Kari, Bai Li, Marek Szykuła)....Pages 109-120
Online Stochastic Pattern Matching (Marco Cognetta, Yo-Sub Han)....Pages 121-132
State Complexity of Reversals of Deterministic Finite Automata with Output (Sylvie Davies)....Pages 133-145
Algorithms and Training for Weighted Multiset Automata and Regular Expressions (Justin DeBenedetto, David Chiang)....Pages 146-158
Solving Parity Games: Explicit vs Symbolic (Antonio Di Stasio, Aniello Murano, Moshe Y. Vardi)....Pages 159-172
Generalised Twinning Property (Stefan Gerdjikov)....Pages 173-185
Non-self-embedding Grammars, Constant-Height Pushdown Automata, and Limited Automata (Bruno Guillon, Giovanni Pighizzini, Luca Prigioniero)....Pages 186-197
The Ranges of Accepting State Complexities of Languages Resulting From Some Operations (Michal Hospodár, Markus Holzer)....Pages 198-210
Semilinearity of Families of Languages (Oscar H. Ibarra, Ian McQuillan)....Pages 211-222
The Exact Complexity of Star-Complement-Star (Jozef Jirásek, Galina Jirásková)....Pages 223-235
Parametrizing String Assembling Systems (Martin Kutrib, Matthias Wendlandt)....Pages 236-247
Two Routes to Automata Minimization and the Ways to Reach It Efficiently (Sylvain Lombardy, Jacques Sakarovitch)....Pages 248-260
Towards the Algorithmic Molecular Self-assembly of Fractals by Cotranscriptional Folding (Yusei Masuda, Shinnosuke Seki, Yuki Ubukata)....Pages 261-273
On the Values for Factor Complexity (Birzhan Moldagaliyev, Ludwig Staiger, Frank Stephan)....Pages 274-285
Enumeration of Cryptarithms Using Deterministic Finite Automata (Yuki Nozaki, Diptarama Hendrian, Ryo Yoshinaka, Ayumi Shinohara)....Pages 286-298
One-Counter Automata for Parsing and Language Approximation (Alexander Sakharov)....Pages 299-311
On Syntactic Complexity of Circular Semi-flower Automata (Shubh N. Singh, K. V. Krishna)....Pages 312-323
Complexity of Proper Suffix-Convex Regular Languages (Corwin Sinnamon)....Pages 324-338
Back Matter ....Pages 339-339