Journal: Int. J. Found. Comput. Sci.

Volume 31, Issue 8

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