DCFS 2016 Accepted Papers

1. Janusz Brzozowski. True State Complexity of Binary Operations on Regular Languages
2. Janusz Brzozowski, Galina Jiraskova, Bo Liu, Aayush Rajasekaran and Marek Szykuła. On the State Complexity of the Shuffle of Regular Languages
3. Timothy Ng, David Rappaport and Kai Salomaa. State Complexity of Prefix Distance of Subregular Languages
4. 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
5. Giovanna Lavado, Giovanni Pighizzini and Luca Prigioniero. Minimal and Reduced Reversible Automata
6. Zoltan Esik and Szabolcs Ivan. MSO-definable properties of Muller context-free languages are decidable
7. Lukas Fleischer and Manfred Kufleitner. Operations on Weakly Recognizing Morphisms
8. Henning Fernau, Lakshmanan Kuppusamy and Indhumathi Raman. Descriptional Complexity of Graph-controlled Insertion-deletion Systems
9. Laurette Marais and Lynette Van Zijl. Unary Self-Verifying Symmetric Difference Automata
10. Galina Jiraskova, Alexander Szabari and Juraj Sebej. The Complexity of Languages Resulting from the Concatenation Operation
11. Andrea Herrmann, Martin Kutrib, Andreas Malcher and Matthias Wendlandt. Descriptional Complexity of Bounded Regular Languages
12. Vojtěch Vorel. Two Results on Discontinuous Input Processing
13. Henning Fernau, Rudolf Freund, Rani Siromoney and K G Subramanian. Contextual Array Grammars with Matrix and Regular Control