Accepted Papers
Full Papers
1 "A Disambiguation Algorithm for Finite Automata and Functional Transducers", Mehryar Mohri
2 "A Fast Suffix Automata Based Algorithm for Exact Online String Matching", Simone Faro and Thierry Lecroq
3 "A Pushdown Transducer Extension for the OpenFst Library", Cyril Allauzen and Michael Riley
4 "Automatic Theorem-Proving in Combinatorics on Words", Dane Henshall and Jeffrey Shallit
5 "Cellular automata on regular rooted trees", Tullio Ceccherini-Silberstein, Michel Coornaert, Francesca Fiorenzi and Zoran Sunic
6 "Crossing the Syntactic Barrier: Hom-Disequalities for H1-Clauses", Andreas Reuss and Helmut Seidl
7 "How to Synchronize the Heads of a Multitape Automaton", Oscar Ibarra and Nicholas Tran
8 "Hyper-Minimization for Deterministic Tree Automata", Artur Jeż and Andreas Maletti
9 "Implementing computations in automaton (semi)groups", Ines Klimann, Jean Mairesse and Matthieu Picantin
10 "Nominal automata for resource usage control", Pierpaolo Degano, Gianluigi Ferrari and Gianluca Mezzetti
11 "On the Descriptional Complexity of the Window Size for Deterministic Restarting Automata", Martin Kutrib and Friedrich Otto
12 "On the State and Computational Complexity of the Reverse of Acyclic Minimal DFAs", Galina Jiraskova and Tomas Masopust
13 "P(l)aying for Synchronization", Fedor Fominykh and Mikhail Volkov
14 "Regular Ideal Languages and their Boolean Combinations", Franz Jahn, Manfred Kufleitner and Alexander Lauser
15 "Restarting Tiling Automata", Daniel Prusa and Frantisek Mraz
16 "Strict local testability with consensus equals regularity", Stefano Crespi Reghizzi and Pierluigi San Pietro
17 "Synchronization of automata with one undefined or ambiguous transition", Martyugin Pavel
18 "Synchronizing Automata on Quasi Eulerian Digraph", Mikhail Berlinkov
19 "Synchronizing automata of bounded rank", Vladimir Gusev
20 "Weak Inclusion for recursive XML Types", Joshua Amavi, Jacques Chabin and Pierre Rety
21 "Weighted Nested Word Automata and Logics over Strong Bimonoids", Manfred Droste and Bundit Pibaljommee
2 "A Fast Suffix Automata Based Algorithm for Exact Online String Matching", Simone Faro and Thierry Lecroq
3 "A Pushdown Transducer Extension for the OpenFst Library", Cyril Allauzen and Michael Riley
4 "Automatic Theorem-Proving in Combinatorics on Words", Dane Henshall and Jeffrey Shallit
5 "Cellular automata on regular rooted trees", Tullio Ceccherini-Silberstein, Michel Coornaert, Francesca Fiorenzi and Zoran Sunic
6 "Crossing the Syntactic Barrier: Hom-Disequalities for H1-Clauses", Andreas Reuss and Helmut Seidl
7 "How to Synchronize the Heads of a Multitape Automaton", Oscar Ibarra and Nicholas Tran
8 "Hyper-Minimization for Deterministic Tree Automata", Artur Jeż and Andreas Maletti
9 "Implementing computations in automaton (semi)groups", Ines Klimann, Jean Mairesse and Matthieu Picantin
10 "Nominal automata for resource usage control", Pierpaolo Degano, Gianluigi Ferrari and Gianluca Mezzetti
11 "On the Descriptional Complexity of the Window Size for Deterministic Restarting Automata", Martin Kutrib and Friedrich Otto
12 "On the State and Computational Complexity of the Reverse of Acyclic Minimal DFAs", Galina Jiraskova and Tomas Masopust
13 "P(l)aying for Synchronization", Fedor Fominykh and Mikhail Volkov
14 "Regular Ideal Languages and their Boolean Combinations", Franz Jahn, Manfred Kufleitner and Alexander Lauser
15 "Restarting Tiling Automata", Daniel Prusa and Frantisek Mraz
16 "Strict local testability with consensus equals regularity", Stefano Crespi Reghizzi and Pierluigi San Pietro
17 "Synchronization of automata with one undefined or ambiguous transition", Martyugin Pavel
18 "Synchronizing Automata on Quasi Eulerian Digraph", Mikhail Berlinkov
19 "Synchronizing automata of bounded rank", Vladimir Gusev
20 "Weak Inclusion for recursive XML Types", Joshua Amavi, Jacques Chabin and Pierre Rety
21 "Weighted Nested Word Automata and Logics over Strong Bimonoids", Manfred Droste and Bundit Pibaljommee
Short Papers
1 "Automata with Modulo Counters and Nondeterministic Counter Bounds", Daniel Reidenbach and Markus L. Schmid
2 "Factor and Subsequence Kernels of Rational Languages", Ahmed Amarni and Sylvain Lombardy
3 "Multi-Tilde-Bar Expressions and their Derivatives", Pascal Caron, Jean-Marc Champarnaud and Ludovic Mignot
4 "On Positive TAGED with a Bounded Number of Constraints", Pierre-Cyrille Heam, Vincent Hugot and Olga Kouchnarenko
5 "On the weighted closure problem", Sylvain Lombardy and Jacques Sakarovitch
6 "SDFA: Series DFA for Memory-Efficient Regular Expression Matching", Tingwen Liu, Yong Sun, Li Guo and Binxing Fang
7 "Weighted LTL with Discounting", Eleni Mandrali
2 "Factor and Subsequence Kernels of Rational Languages", Ahmed Amarni and Sylvain Lombardy
3 "Multi-Tilde-Bar Expressions and their Derivatives", Pascal Caron, Jean-Marc Champarnaud and Ludovic Mignot
4 "On Positive TAGED with a Bounded Number of Constraints", Pierre-Cyrille Heam, Vincent Hugot and Olga Kouchnarenko
5 "On the weighted closure problem", Sylvain Lombardy and Jacques Sakarovitch
6 "SDFA: Series DFA for Memory-Efficient Regular Expression Matching", Tingwen Liu, Yong Sun, Li Guo and Binxing Fang
7 "Weighted LTL with Discounting", Eleni Mandrali