18th International Conference on Descriptional Complexity of Formal Systems
Bucharest, Romania July 5-8, 2016
The Working Conference  
Call for Papers  
Important Dates  
Invited Speakers  
Steering Committee  
Program Committee  
Previous DCFSs  
Related Conferences  
Location (Venue)  
Travelling Information  
Accepted Papers  
Solomon Marcus Heritage  

Tentative program of the Conference

The day of July 5 has been reserved for commemoration of Professor Solomon Marcus, who was an invited speaker to DCFS 2016.

Wednesday, July 6, 2016

Session ChairCezar Campeanu
9:30-10:30Invited Talk: Heapability, interactive particle systems, partial orders: results and open problemsGabriel Istrate
10:30-11:00Coffee Break
Session ChairGabriel Istrate
11:00-11:30On the State Complexity of the Shuffle of Regular LanguagesJanusz Brzozowski, Galina Jiraskova, Bo Liu, Aayush Rajasekaran, and Marek Szykuła
11:30-12:00On the State Complexity of Partial Derivative Automata for Regular Expressions with IntersectionSabine Broda, António Machiavelo, Nelma Moreira, Rogério Reis, and Rafaela Bastos
12:00 - 12:30Unary Self-Verifying Symmetric Difference AutomataLaurette Marais and Lynette Van Zijl
Session ChairMartin Kutrib
14:00-15:00Invited Talk: Completely reachable automataMikhail Volkov
15:00-15:30Coffee Break
Session ChairRogerio Reis
15:30-16:00MSO-definable properties of Muller context-free languages are decidableZoltan Esik and Szabolcs Ivan
16:00-16:30Operations on Weakly Recognizing MorphismsLukas Fleischer and Manfred Kufleitner
16:30-17:00The Complexity of Languages Resulting from the Concatenation OperationGalina Jiraskova, Alexander Szabari, and Juraj Sebej
19:00-21:00Welcome Party

Thursday, July 7, 2016

Session ChairStavros Konstantinidis
9:00-10:00Invited Talk: Words Avoiding Patterns, Enumeration Problems and the Chomsky HierarchyJames Currie
10:00-10:30Coffee Break
Session ChairNelma Moreira
10:30-11:00Unrestricted State Complexity of Binary Operations on Regular LanguagesJanusz Brzozowski
11:00-11:30State Complexity of Prefix Distance of Subregular LanguagesTimothy Ng, David Rappaport, and Kai Salomaa
11:30-12:00Minimal and Reduced Reversible AutomataGiovanna Lavado, Giovanni Pighizzini, and Luca Prigioniero
12:00-12:30Descriptional Complexity of Graph-controlled Insertion-deletion SystemsHenning Fernau, Lakshmanan Kuppusamy, and Indhumathi Raman
13:30-18:00Social Event
18:00-22:00Conference Dinner

Friday, July 8, 2016

9:30-10:00Bussiness Meeting
Session ChairRudolf Freund
10:00-11:00Invited Talk: Self-Verifying Finite Automata and Descriptional ComplexityGalina Jiraskova
11:00-11:30Coffee Break
Session ChairGiovanni Pigizzini
11:30-12:00Two Results on Discontinuous Input ProcessingVojtěch Vorel
12:00-12:30Contextual Array Grammars with Matrix and Regular ControlHenning Fernau, Rudolf Freund, Rani Siromoney, and K G Subramanian
12:30-13:00Descriptional Complexity of Bounded Regular LanguagesAndrea Herrmann, Martin Kutrib, Andreas Malcher, and Matthias Wendlandt
Session ChairCezar Campeanu
14:30-15:30Open Problem Session
15:30-16:00Coffee Break
16:00--Free Discussions

Last modified: Wednesday July 27, 2016 at 11:38 pm EET
DCFS 2016