Accepted Papers

• Johanna Björklund and Loek Cleophas. Minimization of finite state automata through partition aggregation
• Davide Bresolin and Ivan Lanese. Most General Property-Preserving Updates
• Benedikt Brütsch, Patrick Landwehr and Wolfgang Thomas. ℕ-Memory Automata Over the Alphabet ℕ
• Janusz Brzozowski and Corwin Sinnamon. Complexity of Left-Ideal, Suffix-Closed and Suffix-Free Languages
• Giovanni Casu and G. Michele Pinna. Merging relations: a way to compact Petri nets' behaviors uniformly
• Haiming Chen and Ping Lu. Derivatives and Finite Automata of Expressions in Star Normal Form
• Nariyoshi Chida and Kimio Kuramitsu. Linear Parsing Expression Grammars
• Nadia Creignou, Markus Kröll, Reinhard Pichler, Sebastian Skritek and Heribert Vollmer. On the Complexity of Hard Enumeration Problems
• Flavio Dalessandro, Oscar H. Ibarra and Ian McQuillan. On Finite-Index Indexed Grammars and Their Restrictions
• Henk Don and Hans Zantema. Finding DFAs with maximal shortest synchronizing word length
• Bernd Gärtner and Abdolahad Noori Zehmakan. Color War: Cellular Automata with Majority Rule
• Stefan Gerdjikov and Stoyan Mihov. Over which Monoids is the Transducer Determinization Procedure Applicable?
• Dick Grune, Wan Fokkink, Evangelos Chatzikalymnios, Brinio Hond and Peter Rutgers. Detecting Useless Transitions in Pushdown Automata
• Yo-Sub Han, Sang-Ki Ko, Timothy Ng and Kai Salomaa. Consensus String Problem for Multiple Regular Languages
• Thomas Hildebrandt, Christian Johansen and Håkon Normann. A Stable Non-interleaving Early Operational Semantics for the Pi-calculus
• Mika Hirvensalo, Etienne Moutot and Abuzer Yakaryilmaz. On the computational power of affine automata
• Lisa Hutschenreiter and Rafael Peñaloza. An Automata View to Goal-directed Methods
• Costas Iliopoulos, Ritu Kundu and Solon Pissis. Efficient Pattern Matching in Elastic-Degenerate Strings
• Adam Jardine and Kevin McMullin. Efficient Learning of Tier-based Strictly k-Local Languages
• Makoto Kanazawa and Ryo Yoshinaka. The Strong, Weak, and Very Weak Finite Context and Kernel Properties
• Shmuel Tomi Klein and Dana Shapira. Integrated Encryption in Dynamic Arithmetic Compression
• Dušan Knop. Partitioning graphs into induced subgraphs
• Manasi S. Kulkarni and Kalpana Mahalingam. Two-Dimensional Palindromes and Their Properties
• Ruggero Lanotte and Massimo Merro. A Calculus of Cyber-Physical Systems
• Chunmiao Li and Xiaojuan Cai. Hardness Results for Coverability Problem of Well-Structured Pushdown Systems
• Mark-Jan Nederhof and Anssi Yli-Jyra. A derivational model of discontinuous parsing
• Adrien Pommellet, Tayssir Touili and Marcio Diaz. Reachability Analysis of Pushdown Systems with an Upper Stack
• Vidhya Ramaswamy, Jayalal Sarma and K. S. Sunil. Space Complexity of Labelled Graph Reachability Problem
• Johannes Schmidt. The weight in Enumeration
• Jiri Sima and Petr Savicky. Cut Languages in Rational Bases
• Hellis Tamm and Brink Van Der Merwe. Lower Bound Methods for the Size of Nondeterministic Finite Automata Revisited