Accepted Papers

Robert Bakarić, Damir Korenčić, and Strahil Ristov:
Enumerated Automata Implementation of String Dictionaries
Gilad Baruch, Shmuel T. Klein, and Dana Shapira:
New Approaches for Context Sensitive Flash Codes
A. Baskar, R. Ramanujam, and S. P. Suresh:
Dolev-Yao Theory with Associative Blindpair Operators:
An Automata-Theoretic Approach
Simon Beier and Markus Holzer:
Semi-Linear Lattices and Right One-Way Jumping Finite Automata (Extended Abstract)
Johanna Björklund, Frank Drewes, and Giorgio Satta:
Z-Automata for Compact and Direct Representation of Unranked Tree Languages
Angelo Borsotti, Luca Breveglieri, Stefano Crespi Reghizzi, and Angelo Morzenti:
A Benchmark Production Tool for Regular Expressions
Shuhei Denzumi:
New Algorithms for Manipulating Sequence BDDs
Akio Fujiyoshi and Daniel Průša:
A Simple Extension to Finite Tree Automata for Defining Sets of Labeled, Connected Graphs
Zoltán Fülöp and Andreas Maletti:
Composition Closure of Linear Weighted Extended Top-Down Tree Transducers
Yo-Sub Han, Hwee Kim, Yusei Masuda, and Shinnosuke Seki:
A General Architecture of Oritatami Systems for Simulating Arbitrary Finite Automata
Michal Hospodár:
Descriptional Complexity of Power and Positive Closure on Convex Languages
Stavros Konstantinidis, Mitja Mastnak, and Juraj Šebej:
Partitioning a Symmetric Rational Relation into Two Asymmetric Rational Relations
Stavros Konstantinidis, Nelma Moreira, João Pires, and Rogério Reis:
Partial Derivatives of Regular Expressions over Alphabet-Invariant and User-Defined Labels
Martin Kutrib, Andreas Malcher, and Matthias Wendlandt:
Input-Driven Multi-Counter Automata
František Mráz, Daniel Průša, and Michael Wehar:
Two-Dimensional Pattern Matching against Basic Picture Languages
Taylor J. Smith and Kai Salomaa:
Decision Problems for Restricted Variants of Two-Dimensional Automata
Yuta Takahashi, Kazuyuki Asada, and Keisuke Nakano:
Streaming Ranked-Tree-to-String Transducers