Tuesday

Tuesday Wednesday Thursday Friday

Program table

9:00-10:00

Ming Li

Information Distance and Applications

10:00-10:30

Coffee

10:30-11:00

Anna Frid

Commutation of Binary Factorial Languages

11:00-11:30

Yo-Sub Han, Kai Salomaa

State Complexity of Union and Intersection of Finite Languages

11:30-12:00

Artur Jeż

Conjunctive grammars can generate non-regular unary languages

12:00-13:30

Lunch

13:30-14:00

Francine Blanchet-Sadri, Naomi Brownstein, Justin Palumbo

Two Element Unavoidable Sets of Partial Words

14:00-14:30

Dominik Freydenberger, Daniel Reidenbach

The Unambiguity of Segmented Morphisms

14:30-15:00

Dalia Krieger, Pascal Ochem, Narad Rampersad, Jeffrey Shallit

Avoiding Approximate Squares

15:00-15:30

Coffee

15:30-16:00

Aleksandrs Belovs, Ansis Rosmanis, Juris Smotrovs

Multi-letter Reversible and Quantum Finite Automata

16:00-16:30

Rūsiņš Freivalds

Non-constructive Methods for Finite Probabilistic Automata

16:30-17:00

Robert Brijder, Hendrik Jan Hoogeboom

Characterizing Reduction Graphs for Gene Assembly in Ciliates

17:00-17:30

Remco Loos, Mitsunori Ogihara

Complexity Theory for Splicing Systems

19:00-22:00

Welcome reception at Formum Marinum, Linnankatu 72