Accepted Papers (random order)
Paper title Author(s)
Path-Equivalent Removals of Epsilon-Transitions in a Genomic Weighted Finite Automaton Mathieu Giraud, Philippe Veber, Dominique Lavenier
A Family of Algorithms for Nondeterministic Regular Languages Inference Manuel Vázquez de Parga, Pedro García, José Ruiz
Borders and Finite Automata Martin Simunek, Borivoj Melichar
Does O-Substitution Preserve Recognizability? Andreas Maletti
Tiburon: A Weighted Tree Automata Toolkit Jonathan May, Kevin Knight
Symbolic Implementation of Alternating Automata Roderick Bloem, Alessandro Cimatti, Ingo Pill, Marco Roveri, Simone Semprini
Shift-Resolve Parsing: Simple, Unbounded Lookahead, Linear Time José Fortes Gálvez, Sylvain Schmitz, Jacques Farré
Finding Common Motifs with Gaps using Finite Automata Pavlos Antoniou, Jan Holub, Costas S. Iliopoulos, Borivoj Melichar, Pierre Peterlongo
Correctness Preservation and Complexity of Simple RL-Automata Hartmut Messerschmidt, Frantisek Mraz, Friedrich Otto, Martin Platek
On the Computation of Some Standard Distances between Probabilistic Automata Corinna Cortes, Mehryar Mohri, Ashish Rastogi
Reducing Simple Grammars: Exponential Against Highly-Polynomial Time in Practice Cédric Bastien, Jurek Czyzowicz, Wojciech Fraczak, Wojciech Rytter
Finite-State Temporal Projection Tim Fernando
Hybrid Extended Finite Automata Henning Bordihn, Markus Holzer, Martin Kutrib
Factor Oracles Maxime Crochemore, Lucian Ilie, Emine Seid-Hilmi
Minimization of Tree Automata Parosh Aziz Abdulla, Johanna Högberg, Lisa Kaati
Multi-tape Automata with Symbol Classes Florent Nicart, Jean-Marc Champarnaud, Tibor Csaki, Tamas Gaal, Andre Kempe
Compiling Linguistic Constraints into Finite State Automata Matthieu Constant, Denis Maurel
Forgetting Automata and Unary Languages Jens Gloeckler
Refinement of Near Random Access Video Coding with Weighted Finite Automata German Tischler
Around Hopcroft's Algorithm Manuel Baclet, Claire Pagetti
On-the-fly Branching Bisimulation Minimization for Compositional Analysis Yung-Pin Cheng, Hong-Yi Wang, Yu-Ru Cheng
Structurally Unambiguous Finite Automata Hing Leung
Accepted Posters
Paper title Author(s)
Minimizing Unranked Tree Automata Stefan Raeymaekers, Maurice Bruynooghe
Tree Automata over Infinite Alphabets Michael Kaminski, Tony Tan
Reachability Analysis of Procedural Programs with Affine Integer Arithmetic Michael Luttenberger
Lexical Disambiguation with Polarities and Automata Guillaume Bonfante, Joseph Le Roux, Guy Perrier
A Finite Union of DFAs in Symbolic Model Checking of Infinite Systems Suman Roy, Bhaskar Chakraborty
Parsing Computer Languages with an Automaton Compiled From a Single Regular Expression Adrian Thurston
Universality of Hybrid Quantum Gates and Synthesis Without Ancilla Qudits Guowu Yang, Fei Xie, Xiaoyu Song, Marek Perkowski
Tighter Packed Bit-Parallel NFA for Approximate String Matching Heikki Hyyrö
XSLT Version 2.0 is Turing-Complete: A Purely Transformation Based Proof Ruhsan Onder, Zeki Bayram