| Tuesday, April 2 |
| 9:00 - 9:50 | Jin-Yi Cai:
Complexity Dichotomy for Counting Problems - Invited Lecture |
| 10:00 - 11:40 |
Brink Van der Merwe, Mark Farag, and Jaco Geldenhuys:
Counting Minimal Symmetric Difference NFAs |
| Henning Fernau, Pinar Heggernes, Yngve Villanger:
A Multivariate Analysis of Some DFA Problems |
| Rodrigo de Souza:
Uniformisation of Two-Way Transducers |
| Kenji Hashimoto, Ryuta Sawada, Yasunori Ishihara, Hiroyuki Seki, Toru Fujiwara:
Determinacy and Subsumption for Single-Valued Bottom-Up Tree Transducers |
| 12:10 - 13:50 | Aistis Atminas, Vadim Lozin, Mikhail Moshkov:
Deciding WQO for Factorial Languages |
| Eli Shamir:
Pumping, Shrinking and Pronouns: from Context Free to Indexed Grammars |
| Krishnendu Chatterjee, Siddhesh Chaubal, Sasha Rubin:
How to Travel Between Languages |
| Cewei Cui, Zhe Dang, Thomas R. Fischer, Oscar H. Ibarra:
Execution Information Rate for Some Classes of Automata |
| 15:30 - 17:10 | Éric Laugerotte, Nadia Ouali Sebti, Djelloul Ziadi:
From Regular Tree Expression to Position Tree Automaton |
| Stuart Haber, William Horne, Pratyusa Manadhata, Miranda Mowbray, Prasad Rao:
Efficient Submatch Extraction for Practical Regular Expression |
| Daniel Goč, Hamoon Mousavi, Jeffrey Shallit:
On the Number of Unbordered Factors |
| Jörg Endrullis, Clemens Grabmayer, Dimitri Hendriks:
Mix-Automatic Sequences |
| 17:20 - 18:10 | Joël Ouaknine:
Discrete Linear Dynamical Systems - Invited Tutorial |
| Wednesday, April 3 |
| 10:00 - 11:40 | Giorgio Delzanno, Riccardo Traverso:
Decidability and Complexity Results for Verification of Asynchronous Broadcast Networks |
| Tim Smith:
Infiniteness and Boundedness in 0L, DT0L, and T0L Systems |
| Fabrizio Biondi, Axel Legay, Bo Friis Nielsen, Andrzej Wąsowski:
Maximizing Entropy over Markov Processes |
| 12:10 - 13:50 | Sebastian Bala, Artur Koniński:
Unambiguous Automata Denoting Finitely Sequential Functions |
| Benedikt Bollig, Aiswarya Cyriac, Loïc Hélouët, Ahmet Kara, Thomas Schwentick:
Dynamic Communicating Automata and Branching High-Level MSCs |
| Parisa Babaali, Christopher Knaplund:
On the Construction of a Family of Automata that are Generically Non-Minimal |
| Sebastian Bala, Dariusz Jackowski:
Limited Non-Determinism Hierarchy of Counter Automata |
| 15:30 - 16:20 | Rūsiņš Freivalds, Thomas Zeugmann, Grant Pogosyan:
On the Size Complexity of Deterministic Frequency Automata |
| Johanna Björklund, Henning Fernau, Anna Kasprzik, (presented by Niklas Zechner):
MAT Learning of Universal Automata |
| 16:30 - 17:20 | Luke Ong:
Recursion Schemes, Collapsible Pushdown Automata, and Higher-Order Model Checking (I) - Invited Tutorial |
| Friday, April 5 |
| 9:00 - 9:50 | Kousha Etessami:
Algorithms for Analyzing and Verifying Infinite-state Recursive Probabilistic Systems - Invited Lecture |
| 10:00 - 11:40 | Friedrich Otto:
Asynchronous PC Systems of Pushdown Automata |
| Stanislav Žák, Jiří Šíma:
A Turing Machine Distance Hierarchy |
| Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Tomasz Waleń:
Linear-Time Version of Holub's Algorithm for Morphic Imprimitivity Testing |
| Rajeev Alur, Sampath Kannan, Kevin Tian, Yifei Yuan:
On The Complexity of Shortest Path Problems on Discounted Cost Graphs |
| 12:10 - 13:50 | Francine Blanchet-Sadri, Justin Lazarow:
Suffix Trees for Partial Words and the Longest Common Compatible Prefix Problem |
| Daniel Goč, Kalle Saari, Jeffrey Shallit:
Primitive Words and Lyndon Words in Automatic and Linearly Recurrent Sequences |
| Francine Blanchet-Sadri, Michelle Bodnar, Nathan Fox, Joe Hidakatsu:
A Graph Polynomial Approach to Primitivity |
| Luke Schaeffer:
Ostrowski Numeration and the Local Period of Sturmian Words |
| 15:30 - 16:20 | Seppo Sippu, Eljas Soisalon-Soininen:
Online Matching of Multiple Regular Patterns with Gaps and Character Classes |
| Billel Benzaid, Riccardo Dondi, Nadia El-Mabrouk:
Duplication-Loss Genome Alignment: Complexity and Algorithm |
![[Valid RSS]](images/valid-rss-rogers.png "[Valid RSS]")