Full Papers
Andreas Maletti. Better Hyper-Minimization --- Not as Fast, but Fewer ErrorsNorbert Hundeshagen, Friedrich Otto and Marcel Vollweiler. Transductions computed by PC-systems of monotone deterministic restarting automata
Satoshi Okui and Taro Suzuki. Disambiguation in Regular Expression Matching via Position Automata with Augmented Transitions
Daniel Reidenbach and Markus Schmid. A Polynomial Time Match Test for Large Classes of Extended Regular Expressions
Jean-Marc Champarnaud, Jean-Philippe Dubernard and Hadrien Jeanne. Regular Geometrical Languages and Tiling the Plane
vincent le maout. Regular Expressions at their Best: A Case for Rational Design
Attila Egri-Nagy and Chrystopher L. Nehaniv. On Straight Words and Minimal Permutators in Finite Transformation Semigroups
Jan Zdarek and Bořivoj Melichar. A Note on a Tree-based 2D Indexing
Marco Almeida, Nelma Moreira and Rogério Reis. Incremental DFA minimisation
Bo Cui, Yuan Gao, Lila Kari and Sheng Yu. State complexity of catenation combined with union and intersection
Radu Grosu. The Cayley-Hamilton Theorem for Noncommutative Semirings
Zoltán Ésik and Andreas Maletti. Simulations of Weighted Tree Automata
Volker Diekert and Steffen Kopecki. Complexity Results and the Growths of Hairpin Completions of Regular Languages
Jan Antoš and Bořivoj Melichar. Finite Automata for Generalized Approach to Backward Pattern Matching
José Bacelar Almeida, Nelma Moreira, David Pereira and Simão Melo de Sousa. Partial Derivative Automata Formalized in Coq
Chiara Epifanio, Christiane Frougny, Alessandra Gabriele, Filippo Mignosi and Jeffrey Shallit. On lazy representations and Sturmian graphs.
Ming-Hsien Tsai, Seth Fogarty, Moshe Vardi and Yih-Kuen Tsay. State of Buchi Complementation
Marinella Sciortino, Giusi Castiglione and Cyril Nicaud. A challenging family of automata for classical minimization algorithms
Martin Kutrib and Andreas Malcher. Two-Party Watson-Crick Computations
Ingmar Meinecke and Manfred Droste. Regular Expressions on Average and in The Long Run
Cristina Tîrnăucă and Cătălin Ionuț Tîrnăucă. Types of Trusted Information That Make DFA Identification Feasible
Manfred Kufleitner and Alexander Lauser. Partially Ordered Two-way Buchi Automata
Brent Heeringa and Michael Gerbush. Approximating Minimum Reset Sequences
Cyril Allauzen, Corinna Cortes and Mehryar Mohri. Large-Scale Training of SVMs with Automata Kernels
Cyril Allauzen, Michael Riley and Johan Schalkwyk. Filters for Efficient Composition of Weighted Finite-State Transducers
Fang Yu, Tevfik Bultan and Oscar Ibarra. Relational String Verification Using Multi-track Automata
Short Papers
Krzysztof Chmiel and Adam Roman. COMPAS - a computing package for synchronizationWit Forys, Piotr Oprocha and Slawomir Bakalarski. Symbolic Dynamics, Flower Automata and Infinite Traces
Howard Johnson. Uniformizing Rational Relations for Natural Language Applications using Weighted Determinization
Daniel Neider. Reachability Games on Automatic Graphs
Liu Yanbing, Guo Li, Liu Ping and Tan Jianlong. Compressing Regular Expressions' DFA Table by Matrix Decomposition
Alessandro Cimatti, Sergio Mover, Marco Roveri and Stefano Tonetta. From Sequential Extended Regular Expressions to NFA with Symbolic Labels
Poster Download