CIAA 2021      

International Conference on Implementation and Application of Automata

July 19–22

Home Important Dates Program Committees Submissions Accepted Invited Speakers Registration/Travel

Conference Program

The session times are provided in local time for Bremen, i.e. CET.
Thus the sessions start at 13:00h CET, which corresponds to 20:00h Japanese Standard Time and 7:00h EDT Toronto, for example.

July 19
13:00 - 13:50 Mikolaj Bojanczyk Invited: Polyregular Functions
13:50 - 14:15 Brink van der Merwe, Jacobie Mouton,
Steyn van Litsenorgh and Martin Berglund
Memoized Regular Expressions
14:15 - 14:40 Su-Hyeon Kim, Hyeonseung Im
and Sang-Ki Ko
Efficient Enumeration of Regular Expressions for Faster Regular Expression Synthesis
14:40 - 15:05 Stefan Hoffmann The Commutative Closure of Shuffle Languages over Group Languages is Regular
July 20
13:00 - 13:50 Jeffrey Shallit Invited: Say No to Case Analysis: Automating the Drudgery of Case-Based Proofs (slides)
13:50 - 14:15 Martin Kutrib and Luca Prigioniero Boolean Kernels of Context-Free Languages
14:15 - 14:40 Markus Holzer and Christian Rauch The Range of State Complexities of Languages Resulting from the Cascade Product -- The Unary Case
14:40 - 15:05 Andreas Maletti, Teodora Nasz,
Kevin Stier and Markus Ulbricht
Ambiguity Hierarchies for Weighted Tree Automata
July 21
13:00 - 13:25 Guy Arbitman, Shmuel Tomi Klein,
Pierre Peterlongo and Dana Shapira
Approximate Hashing for Bioinformatics
13:25 - 13:50 Taylor Smith and Kai Salomaa Degrees of Restriction for Two-Dimensional Automata
13:50 - 14:15 Simone Faro and Stefano Scafiti Efficient String Matching Based on a Two-Step Simulation of the Suffix Automaton
14:15 - 14:40 Stefan Hoffmann Regularity Conditions for Iterated Shuffle on Commutative Regular Languages
July 22
13:00 - 13:50 Javier Esparza Invited: Back to the Future: A Fresh Look at Linear Temporal Logic
13:50 - 14:15 Diana Geneva, Georgi Shopov
and Stoyan Mihov
Algorithms for Probabilistic and Stochastic Subsequential Failure Transducers
14:15 - 14:40 Cinzia Di Giusto, Laetitia Laversa
and Etienne Lozes
Guessing the buffer bound for k-synchronizablilty
14:40 - 15:05 Stefan Hoffmann State Complexity of Permutation and Related Decision Problems on Alphabetical Pattern Constraints