|
|
Accepted Papers
|
 |
 |
|
DCFS 2016 Accepted Papers
-
Janusz Brzozowski.
True State Complexity of Binary Operations on Regular Languages
- Janusz Brzozowski, Galina Jiraskova, Bo Liu, Aayush Rajasekaran and Marek Szykuła.
On the State Complexity of the Shuffle of Regular Languages
- Timothy Ng, David Rappaport and Kai Salomaa.
State Complexity of Prefix Distance of Subregular Languages
-
Sabine Broda, António Machiavelo, Nelma Moreira, Rogério Reis and Rafaela Bastos.
On the State Complexity of Partial Derivative Automata for Regular Expressions with Intersection
-
Giovanna Lavado, Giovanni Pighizzini and Luca Prigioniero.
Minimal and Reduced Reversible Automata
-
Zoltan Esik and Szabolcs Ivan.
MSO-definable properties of Muller context-free languages are decidable
-
Lukas Fleischer and Manfred Kufleitner.
Operations on Weakly Recognizing Morphisms
-
Henning Fernau, Lakshmanan Kuppusamy and Indhumathi Raman.
Descriptional Complexity of Graph-controlled Insertion-deletion Systems
-
Laurette Marais and Lynette Van Zijl.
Unary Self-Verifying Symmetric Difference Automata
-
Galina Jiraskova, Alexander Szabari and Juraj Sebej.
The Complexity of Languages Resulting from the Concatenation Operation
-
Andrea Herrmann, Martin Kutrib, Andreas Malcher and Matthias Wendlandt.
Descriptional Complexity of Bounded Regular Languages
-
Vojtěch Vorel.
Two Results on Discontinuous Input Processing
-
Henning Fernau, Rudolf Freund, Rani Siromoney and K G Subramanian.
Contextual Array Grammars with Matrix and Regular Control
|
|
|