Friday

Tuesday Wednesday Thursday Friday

Program table

9:00-10:00

Jacques Sakarovitch

Finite Automata and the Writing of Numbers

10:00-10:30

Coffee

10:30-11:00

Sandrine Julia, Vinh Duc Tran

Reduced languages as ω-generators

11:00-11:30

Andreas Malcher, Giovanni Pighizzini

Descriptional Complexity of Bounded Context-Free Languages

11:30-12:00

Hermann Gruber, Markus Holzer

Inapproximability of Nondeterministic State and Transition Complexity Assuming P≠NP

12:00-13:30

Lunch

13:30-14:00

Dario Carotenuto, Aniello Murano, Adriano Peron

2-Visibly Pushdown Automata

14:00-14:30

Javier Esparza, Stefan Kiefer, Michael Luttenberger

An Extension of Newton's Method to ω-Continuous Semirings

14:30-15:00

Hellis Tamm

On Transition Minimality of Bideterministic Automata

15:00-15:30

Coffee

15:30-16:00

Alberto Bertoni, Roberto Radicioni

Approximability and Non-approximability Results in Computing the Mean Speedup of Trace Monoids

16:00-16:30

Edward Ochmański, Krystyna Stawikowska

A Star Operation for Star-Free Trace Languages

16:30-17:00

Johanna Högberg, Andreas Maletti, Jonathan May

Bisimulation Minimisation for Weighted Tree Automata

17:00-17:30

Christian Mathissen

Definable Transductions and Weighted Logics for Texts