Duomo di Milano by Giorgio Minguzzi, used under CC BY-SA / Cropped from original

Accepted Papers

  • Janusz A. Brzozowski and Sylvie Davies
    Most Complex Non-Returning Regular Languages
  • Henning Fernau, Lakshmanan Kuppusamy and Indhumathi Raman
    Graph-Controlled Insertion-Deletion Systems Generating Language Classes Beyond Linearity
  • Kent Kwee and Friedrich Otto
    A Pumping Lemma for Ordered Restarting Automata
  • Laurette Marais and Lynette van Zijl
    State Complexity of Unary SV-XNFA with Different Acceptance Conditions
  • Chris Keeler and Kai Salomaa
    Branching Measures and Nearly Acyclic NFAs
  • Timothy Ng, David Rappaport and Kai Salomaa
    State Complexity of Suffix Distance
  • Giovanna Lavado and Luca Prigioniero
    Concise Representations of Reversible Automata
  • Ivana Krajňáková and Galina Jirásková
    Square on Deterministic, Alternating, and Boolean Finite Automata
  • Suna Bensch and Maia Hoeberechts
    On the Degree of Nondeterminism of Tree Adjoining Languages and Head Grammar Languages
  • Kitti Gelle and Szabolcs Ivan
    Recognizing Union-Find trees built up using union-by-rank strategy is NP-complete
  • Marina Maslennikova
    Reset Complexity of Ideal Languages Over a Binary Alphabet
  • Sabine Broda, António Machiavelo, Nelma Moreira and Rogério Reis
    On the Average Complexity of Strong Star Normal Form
  • Rudolf Freund, Vladimir Rogojin and Sergey Verlan
    Computational Completeness of Networks of Evolutionary Processors with Elementary Polarizations and a Small Number of Processors
  • Yo-Sub Han, Hwee Kim, Trent Rogers and Shinnosuke Seki
    Self-attraction removal from oritatami systems
  • Markus Holzer and Martin Kutrib
    One-Time Nondeterministic Computations (Extended Abstract)
  • Rachel Faran and Orna Kupferman
    A Parametrized Analysis of Algorithms on Hierarchical Graphs
  • Alexander Okhotin and Kai Salomaa
    Quotients of input-driven pushdown automata
  • Jozef Jirásek, Matúš Palmovský and Juraj Šebej
    Kuratowski Algebras Generated by Factor-, Subword-, and Suffix-Free Languages
  • Maksims Dimitrijevs and Abuzer Yakaryilmaz
    Uncountable realtime probabilistic classes
  • Turlough Neary
    2-state 2-symbol Turing machines with periodic support produce regular sets