979 | -- | 982 | Cezar Câmpeanu. Implementations and Applications of Automata 2018: Preface |
983 | -- | 1019 | Stavros Konstantinidis, Nelma Moreira, Rogério Reis, Joshua Young. Regular Expressions and Transducers Over Alphabet-Invariant and User-Defined Labels |
1021 | -- | 1049 | Holger Bock Axelsen, Martin Kutrib, Andreas Malcher, Matthias Wendlandt. Boosting Reversible Pushdown and Queue Machines by Preprocessing |
1051 | -- | 1068 | Samira Attou, Ludovic Mignot, Djelloul Ziadi. The Bottom-Up Position Tree Automaton and the Father Automaton |
1069 | -- | 1089 | Laurent Bartholdi, Thibault Godin, Ines Klimann, Camille Noûs, Matthieu Picantin. A New Hierarchy for Automaton Semigroups |
1091 | -- | 1112 | Mikhail V. Berlinkov, Cyril Nicaud. Synchronizing Almost-Group Automata |
1113 | -- | 1132 | Janusz A. Brzozowski, Lila Kari, Bai Li, Marek Szykula. State Complexity of Overlap Assembly |
1133 | -- | 1157 | Bruno Guillon, Giovanni Pighizzini, Luca Prigioniero. Non-Self-Embedding Grammars, Constant-Height Pushdown Automata, and Limited Automata |
1159 | -- | 1177 | Michal Hospodár, Markus Holzer 0001. The Ranges of Accepting State Complexities of Languages Resulting from Some Operations |
1179 | -- | 1198 | Oscar H. Ibarra, Ian McQuillan. Semilinearity of Families of Languages |