Table of Contents
|
Descriptional Complexity of Formal Systems
Cezar Câmpeanu, Florin Manea, Jeffrey Shallit |
Front Matter |
Completely Reachable Automata
Eugenija Bondar, Mikhail Volkov |
1-17 |
Heapability, Interactive Particle Systems, Partial Orders: Results and Open Problems
Gabriel Istrate, Cosmin Bonchiş |
18-28 |
Self-Verifying Finite Automata and Descriptional Complexity
Galina Jirásková |
29-44 |
On the State Complexity of Partial Derivative Automata For Regular Expressions with Intersection
Rafaela Bastos, Sabine Broda, António Machiavelo, Nelma Moreira, Rogério Reis |
45-59 |
Unrestricted State Complexity of Binary Operations on Regular Languages
Janusz Brzozowski |
60-72 |
On the State Complexity of the Shuffle of Regular Languages
Janusz Brzozowski, Galina Jirásková, Bo Liu, Aayush Rajasekaran, Marek Szykuła |
73-86 |
MSO-definable Properties of Muller Context-Free Languages Are Decidable
Zoltán Ésik, Szabolcs Iván |
87-97 |
Contextual Array Grammars with Matrix and Regular Control
Henning Fernau, Rudolf Freund, Rani Siromoney, K. Subramanian |
98-110 |
Descriptional Complexity of Graph-Controlled Insertion-Deletion Systems
Henning Fernau, Lakshmanan Kuppusamy, Indhumathi Raman |
111-125 |
Operations on Weakly Recognizing Morphisms
Lukas Fleischer, Manfred Kufleitner |
126-137 |
Descriptional Complexity of Bounded Regular Languages
Andrea Herrmann, Martin Kutrib, Andreas Malcher, Matthias Wendlandt |
138-152 |
The Complexity of Languages Resulting from the Concatenation Operation
Galina Jirásková, Alexander Szabari, Juraj Šebej |
153-167 |
Minimal and Reduced Reversible Automata
Giovanna Lavado, Giovanni Pighizzini, Luca Prigioniero |
168-179 |
Unary Self-verifying Symmetric Difference Automata
Laurette Marais, Lynette Zijl |
180-191 |
State Complexity of Prefix Distance of Subregular Languages
David Rappaport, Kai Salomaa, Timothy Ng |
192-204 |
Two Results on Discontinuous Input Processing
Vojtěch Vorel |
205-216 |
Hosted by HAL : 