Conference Program
Regular talks are allocated 20 minutes for presentation and 5 minutes for questions. Invited talks, 50 and 10 respectively.
| Monday, July 3 2017 | |
|---|---|
| 0830-0900 | Registration |
| 0900-0915 | Opening |
| 0915-1015 | Jürgen Dassow Descriptional Complexity and Operations - Two Non-Classical Cases |
| 1015-1045 | Coffee break |
| 1045-1200 | Marina Maslennikova Reset Complexity of Ideal Languages Over a Binary Alphabet |
| Jozef Jirásek, Matúš Palmovský and Juraj Šebej Kuratowski Algebras Generated by Factor-, Subword-, and Suffix-Free Languages | |
| Janusz A. Brzozowski and Sylvie Davies Most Complex Non-Returning Regular Languages | |
| 1200-1400 | Lunch |
| 1400-1500 | Dora Giammarresi Avoiding Overlaps in Pictures |
| 1500-1530 | Coffee break |
| 1530-1710 | Chris Keeler and Kai Salomaa Branching Measures and Nearly Acyclic NFAs |
| Giovanna Lavado and Luca Prigioniero Concise Representations of Reversible Automata | |
| Ivana Krajňáková and Galina Jirásková Square on Deterministic, Alternating, and Boolean Finite Automata | |
| Alexander Okhotin and Kai Salomaa Quotients of input-driven pushdown automata | |
| 1715-1815 | Business meeting |
| 1900- — | Welcome party |
| Tuesday, July 4 2017 | |
|---|---|
| 0900-1000 | Orna Kupferman Sensing as a Complexity Measure |
| 1000-1030 | Coffee break |
| 1030-1150 | Kitti Gelle and Szabolcs Ivan Recognizing Union-Find trees built up using union-by-rank strategy is NP-complete |
| Rachel Faran and Orna Kupferman A Parametrized Analysis of Algorithms on Hierarchical Graphs | |
| Suna Bensch and Maia Hoeberechts On the Degree of Nondeterminism of Tree Adjoining Languages and Head Grammar Languages | |
| 1200-1400 | Lunch |
| 1400- — | Social event: trip and conference dinner |
| Wednesday, July 5 2017 | |
|---|---|
| 0900-1000 | Stavros Konstantinidis Applications of Transducers in Independent Languages, Word Distances, Codes |
| 1000-1030 | Coffee break |
| 1030-1210 | Markus Holzer and Martin Kutrib One-Time Nondeterministic Computations (Extended Abstract) |
| Turlough Neary 2-state 2-symbol Turing machines with periodic support produce regular sets | |
| Kent Kwee and Friedrich Otto A Pumping Lemma for Ordered Restarting Automata | |
| Maksims Dimitrijevs and Abuzer Yakaryilmaz Uncountable realtime probabilistic classes | |
| 1210-1400 | Lunch |
| 1400-1515 | Henning Fernau, Lakshmanan Kuppusamy and Indhumathi Raman Graph-Controlled Insertion-Deletion Systems Generating Language Classes Beyond Linearity |
| Rudolf Freund, Vladimir Rogojin and Sergey Verlan Computational Completeness of Networks of Evolutionary Processors with Elementary Polarizations and a Small Number of Processors | |
| Yo-Sub Han, Hwee Kim, Trent Rogers and Shinnosuke Seki Self-attraction removal from oritatami systems | |
| 1515-1545 | Coffee break |
| 1545-1700 | Laurette Marais and Lynette van Zijl State Complexity of Unary SV-XNFA with Different Acceptance Conditions |
| Sabine Broda, António Machiavelo, Nelma Moreira and Rogério Reis On the Average Complexity of Strong Star Normal Form | |
| Timothy Ng, David Rappaport and Kai Salomaa State Complexity of Suffix Distance | |
| 1700- — | Closing |