- magyar
- english
- Русский
DCFS 2022 - 24th International Conference on Descriptional Complexity of Formal systems
August 29 - 31, 2022, Debrecen, Hungary
Important Dates
- Submission deadline:
April 10April 24, 2022, - Notification of acceptance:
May 16May 23, 2022, - Final version for proceedings: May 29, 2022.
Technical information
- All times are in CEST (Central European Summer Time)
- How to connect to the online sessions with a web browser
- In case of difficulties, you might also call +36 30 7205585 (György Vaszil)
Monday, August 29
WEBEX: https://unideb.webex.com/unideb-hu/j.php?MTID=m064278b80d7d83d4d9c625344d0a8813
| 8.45 - 9.20 | Registration |
| 9.20 - 9.30 | Opening |
| Chair: György Vaszil | |
| 9.30 - 10.30 | Galina Jirasková (invited talk). Operations on unambiguous finite automata |
| 10.30 - 10.00 | Michal Hospodár, Peter Mlynárčik and Viktor Olejár. Operations on Subregular Languages and Nondeterministic State Complexity |
| 11.00 - 11.30 | Coffee break |
| Chair: Szilárd Fazekas | |
| 11.30 - 12.00 | Viliam Geffert, Dominika Pališínová and Alexander Szabari. State Complexity of Binary Coded Regular Languages |
| 12.00 - 12.30 | Martin Kutrib and Matthias Wendlandt. State Complexity of Finite Partial Languages |
| 12.30 - 14.00 | Lunch, coffee |
| Chair: Szabolcs Iván | |
| 14.00 - 14.30 | Hendrik Maarand and Hellis Tamm. Yet Another Canonical Nondeterministic Automaton |
| 14.30 - 15.00 | Benedek Nagy. Union-complexities of Kleene-plus operation |
| 15.00 - 15.15 | Break |
| 15.15 - 17.15 | Special session to honor Janusz Brzozowski, Helmut Jürgensen, Alica Kelemenová, and Detlef Wotschke, members of the working group who passed away during the last years. The speakers are Rogério Reis, Henning Bordihn, Erzsébet Csuhaj-Varjú, and Andreas Malcher. |
Tuesday, August 30
WEBEX: https://unideb.webex.com/unideb-hu/j.php?MTID=mcdf50f57b3010e305cebf74a08f5756d
| Chair: Rogério Reis | |
| 9.00 - 10.00 | Mikołaj Bojańczyk (invited talk). Polyregular functions |
| 10.00 - 10.30 | Jérôme Durand-Lose. On the power of recursive word-functions without concatenation |
| 10.30 - 11.00 | Coffee break |
| Chair: Henning Bordihn | |
| 11.00 - 11.30 | Sungmin Kim, Yo-Sub Han, Sang-Ki Ko and Kai Salomaa - online. On Simon’s Congruence Closure of a String |
| 11.30 - 12.00 | Pamela Fleischmann, Lukas Haschke, Annika Huch, Annika Mayrock and Dirk Nowotka - online. Nearly k-Universal Words - Investigating a part of Simon's Congruence |
| 12.00 - 12.30 | Szilárd Fazekas and Robert Mercas. Clusters of repetition roots forming prefix chains |
| 12.30 - 14.00 | Lunch, coffee |
| Chair: Erzsébet Csuhaj-Varjú | |
| 14.00 - 15.00 | Szabolcs Iván (invited talk). Scattered context-free order types |
| 15.00 - 15.30 | Stavros Konstantinidis, Mitja Mastnak, Nelma Moreira and Rogério Reis - online. Approximate NFA Universality Motivated by Information Theory |
| 15.30 | Business meeting |
| 17.00 | Guided visit of an exhibition at MODEM - Modern and Contemporary Arts Centre. The address is Hunyadi János utca 1-3. |
| 19.00 | Conference dinner in the restaurant Reskontó Étterem. The address is Péterfia utca 34. |
Wednesday, August 31
WEBEX: https://unideb.webex.com/unideb-hu/j.php?MTID=m8e162619d85d858377a7ae8d53c2ada0
| Chair: Martin Kutrib | |
| 9.00 - 10.00 | Stefano Crespi Reghizzi (invited talk). The alphabetic complexity in homomorphic definitions of word, tree and picture languages |
| 10.00 - 10.30 | Orna Kupferman and Asaf Petruschka - online. Lazy Regular Sensing |
| 10.30 - 11.00 | Coffee break |
| Chair: Galina Jirásková | |
| 11.00 - 11.30 | Markus Holzer and Christian Rauch. On the Descriptional Complexity of the Direct Product of Finite Automata |
| 11.30 - 12.00 | Duncan Adamson - online. Ranking Binary Unlabelled Necklaces in Polynomial Time |
| 12.00 - 12.30 | Stefan Hoffmann - online. Reset Complexity and Completely Reachable Automata with Simple Idempotents |
| 12.30 | Closing |
| 12.40 - 14.00 | Lunch, coffee |
MCU 2022 Open Session - DCFS 2022 participants are welcome!
WEBEX: https://unideb.webex.com/unideb-hu/j.php?MTID=m21e0c22d7bf5c5116b7bd47170293092
| 14.30 - 15.30 | Hava Siegelmann - online (invited talk). Super Turing computing enables lifelong learning AI |
| 15.30 - 16.15 | Erik D. Demaine, Robert Hearn, Dylan Hendrickson and Jayson Lynch - online. PSPACE-Completeness of Reversible Deterministic Systems |
