DCFS 2014 Accepted Papers

Farid Ablayev (Russia) and Marat Ablayev (Russia). Quantum Hashing via $\epsilon$-universal Hashing Constructions and Freivalds Fingerprinting Schemas
Farid Ablayev (Russia), Aida Gainutdinova (Russia), Kamil Khadiev (Russia) and Abuzer Yakaryilmaz (Latvia). Very narrow quantum OBDDs and width hierarchies for classical OBDDs
Artiom Alhazov (Moldova), Bogdan Aman (Romania), Rudolf Freund (Austria) and Gheorghe Paun (Romania). Matter and Anti-Matter in Membrane Systems
Angelo Borsotti (Italy), Luca Breveglieri (Italy), Stefano Crespi Reghizzi (Italy) and Angelo Morzenti (Italy). Complexity of Extended vs Classic LR Parsers
Janusz Brzozowski (Canada) and Gareth Davies (Canada). Most Complex Regular Right-Ideal Languages
Da-Jung Cho (South Korea), Yo-Sub Han (South Korea), Sang-Ki Ko (South Korea) and Kai Salomaa (Canada). State Complexity of Inversion Operations
Enrico Formenti (France), Luca Manzoni (France) and Antonio E. Porreca (Italy). Cycles and Global Attractors of Reaction Systems
Viliam Geffert (Slovakia) and Abuzer Yakaryilmaz (Latvia). Classical automata on promise problems
Mai Gehrke (France), Andreas Krebs (Germany) and Jean-Eric Pin (France). From ultrafilters on words to the expressive power of a fragment of logic
Daniel Goc (Canada) and Kai Salomaa (Canada). Computation Width and Path Size
Markus Holzer (Germany) and Sebastian Jakobi (Germany). Boundary Sets of Regular and Context-Free Languages
Szabolcs Ivan (Hungary), Ádám D. Lelkes (the United States), Judit Nagy-Gyorgy (Hungary), Balazs Szorenyi (Hungary) and Gyorgy Turan (the United States). Biclique coverings, rectifier networks and the cost of epsilon-removal
Sergiu Ivanov (France), Elisabeth Pelz (France) and Sergey Verlan (France). Small Universal Non-deterministic Petri Nets with Inhibitor Arcs
Jan Janousek (the Czech Republic), Martin Poliak (the Czech Republic) and Borivoj Melichar (the Czech Republic). A Full and Linear Index of a Tree for Tree Patterns
Jozef Jirasek (Slovakia), Galina Jiraskova (Slovakia), Monika Krausova (Slovakia), Peter Mlynarcik (Slovakia) and Juraj Sebej (Slovakia). Prefix-Free Languages: Right Quotient and Reversal
Galina Jiraskova (Slovakia) and Peter Mlynarcik (Slovakia). Complement on Prefix-Free, Suffix-Free, and Non-Returning NFA Languages
Prateek Karandikar (India) and Philippe Schnoebelen (France). On the state complexity of closures and interiors of regular languages with subwords
Sang-Ki Ko (South Korea), Ha-Rim Lee (South Korea) and Yo-Sub Han (South Korea). State Complexity of Regular Tree Languages for Tree Pattern Matching
Balagopal Komarath (India), Jayalal Sarma (India) and K.S. Sunil (India). On the Complexity of L-reachability
Andreas Krebs (Germany), Michael Ludwig (Germany), Olga Dorzweiler (Germany) and Thomas Flamm (Germany). Positive and Negative Proofs for Circuits and Branching Programs
Martin Kutrib (Germany), Andreas Malcher (Germany) and Matthias Wendlandt (Germany). Regularity and Size of Set Automata
Giovanna Lavado (Italy), Giovanni Pighizzini (Italy) and Shinnosuke Seki (Finland). Operational state complexity under Parikh equivalence
Marina Maslennikova (Russia).Complexity of checking whether two automata are synchronized by the same language
Friedrich Otto (Germany). On the Descriptional Complexity of Deterministic Ordered Restarting Automata
Alexandros Palioudakis (Canada), Kai Salomaa (Canada) and Selim Akl (Canada). State Complexity of Unary Language Operations for NFAs with Limited Nondeterminism
Holger Petersen (Germany). A Note on Pushdown Automata Systems
Daniel Prusa (the Czech Republic). Non-recursive Trade-offs between Two-dimensional Automata and Grammars