Accepted Papers (in Random Order)

  • Francine Blanchet-Sadri, Kira Goldner and Aidan Shackleton. Minimal Partial Languages and Automata
  • Janusz Brzozowski and Marek Szykula. Large Aperiodic Semigroups
  • Johannes Osterholzer. Pushdown Machines for Weighted Context-Free Tree Translation
  • Petr Kurka and Tomas Vavra. Analytic functions computable by finite state transducers
  • Akim Demaille, Alexandre Duret-Lutz, Sylvain Lombardy, Luca Saiu and Jacques Sakarovitch. A Type System for Weighted Automata and Rational Expressions
  • Abiel Roche-Lima, Mike Domaratzki and Brian Fristensky. Pairwise Rational Kernels Obtained by Automaton Operations
  • Ivone Amorim, António Machiavelo and Rogério Reis. Counting non-equivalent linear finite transducers using a canonical form
  • Maria Pittou and George Rahonis. Weighted variable automata over infinite alphabets
  • Franziska Biegler and Ian McQuillan. On comparing deterministic finite automata and the shuffle of words
  • Marius Dumitran, Javier Gil, Florin Manea and Victor Mitrana. Bounded Prefix-Suffix Duplication
  • Marzio De Biasi and Abuzer Yakaryilmaz. Unary languages recognized by two-way one-counter automata
  • Kristina Cevorova, Galina Jiraskova and Ivana Krajnakova. On the Square of Regular Languages
  • Jibran Rashid and Abuzer Yakaryilmaz. Implications of quantum automata for contextuality
  • Galina Jiraskova, Matúš Palmovský and Juraj Sebej. Kleene Closure on Regular and Prefix-Free Languages
  • Vladimir Gusev and Elena Pribavkina. Reset thresholds of automata with two cycle lengths
  • Eva Maia, Nelma Moreira and Rogério Reis. Partial Derivative and Position Bisimilarity Automata
  • Maria Paola Bianchi, Carlo Mereghetti and Beatrice Palano. On the power of one-way automata with quantum and classical states
  • Sang-Ki Ko and Yo-Sub Han. Left is Better Than Right for Reducing Nondeterminism of NFAs
  • Akio Fujiyoshi. Recognition of Labeled Multidigraphs by Spanning Tree Automata
  • Andreas Maletti. The Power of Regularity-Preserving Multi Bottom-up Tree Transducers
  • Oscar Ibarra. On the Ambiguity, Lossiness, and Finite-Valuedness Problems in Acceptors and Transducers