• The Conference  
• News  
• Call for Papers  
• Topics  
• Submissions  
• Important Dates  
• Invited Speakers  
• Committees  
• Location (Venue)  
• Travelling Information  
• Accommodation  
• Accepted Papers  
• Timetable  
• Photo Gallery  
• Registration  
• Sheng Yu Award  

Accepted Papers

Samira Attou, Ludovic Mignot, and Ziadi Djelloul

The Bottom-Up Position Tree Automaton and its Compact Version

Oscar Ibarra and Ian McQuillan

Semilinearity of Families of Languages

Alexander Sakharov

One-Counter Automata for Parsing and Language Approximation

Stefan Gerdjikov

Generalised Twinning Property

Birzhan Moldagaliyev, Ludwig Staiger and Frank Stephan

On Values for Factor Complexity

Sylvie Davies

State Complexity of Reversals of Deterministic Finite Automata with Output

Antonio DiStasio, Aniello Murano and Moshe Vardi

Solving Parity Games: Explicit vs Symbolic

Corwin Sinnamon

Complexity of Proper Suffix-Convex Regular Languages

Johanna Björklund, Frank Drewes and Anna Jonsson

A Comparison of Two N-Best Extraction Methods for Weighted Tree Automata

Bruno Guillon, Giovanni Pighizzini and Luca Prigioniero

Non-Self-Embedding Grammars, Constant Height Pushdown Automata, and Limited Automata

Cyril Allauzen and Michael Riley

Algorithms for Weighted Finite Automata with Failure Transitions

Mikhail Berlinkov and Cyril Nicaud

Synchronizing random almost-group automata

Justin Debenedetto and David Chiang

Algorithms and Training for Weighted Multiset Automata and Regular Expressions

Janusz Brzozowski, Lila Kari, Bai Li and Marek Szykuła

State Complexity of Overlap Assembly

Sylvain Lombardy and Jacques Sakarovitch

Two routes to automata minimization and the ways to reach it efficiently

Michal Hospodár and Markus Holzer

The Range of Accepting State Complexities of Languages Resulting From Some Operations

Martin Kutrib and Matthias Wendlandt

Parametrizing String Assembling Systems

Yusei Masuda, Shinnosuke Seki and Yuki Ubukata

Towards the Algorithmic Molecular Self-Assembly of Fractals by Cotranscriptional Folding

Marco Cognetta and Yo-Sub Han

Online Stochastic Pattern Matching

Laurent Bartholdi, Thibault Godin, Ines Klimannand Matthieu Picantin

A new hierarchy for automaton semigroups

Shubh Narayan Singh and Venkata Krishna Kanduru

On Syntactic Complexity of Circular Semi-Flower Automata

Jozef Jirasek and Galina Jiraskova

The Exact Complexity of Star-Complement-Star

Yuki Nozaki, Diptarama Hendrian, Ryo Yoshinaka and Ayumi Shinohara

Enumeration of Cryptarithms Using Deterministic Finite Automata

Sponsors: