Page last modified: June 4, 2006

Workshop on Words and Automata

St Petersburg (Russia), June 7th, 2006

A Satellite Workshop to the International Computer Science Symposium in Russia (CSR'06)

The workshop will be held in

St Petersburg Department of Steklov Institute of Mathematics (PDMI

 

located at 27 Fontanka (this is where Fontanka river crosses Nevskiy prospekt, see the map), room 208



PROGRAM

08:30-09:00 REGISTRATION (room 201)
09:00-10:15 First Session. Chair: Anna Frid
09:00-09:05 Opening

09:10-09:50

Invited talk: Jean Berstel (Université de Marne-la-Vallee, France), Crochemore factorization of Sturmian and other infinite words (joint work with Alessandra Savelli)

9:55-10:15

Gwénaël Richomme and Francis Wlazinski, Existence of finite test-sets for k-powerfreeness of uniform morphisms

10:15-10:40

Coffee break

10:40-12:00 Second Session. Chair: Mikhail Volkov

10:40-11:00

Volker Diekert, Tero Harju and Dirk Nowotka, Factorizations of cyclic words

11:05-11:25

Marcella Anselmo, Dora Giammarresi, Maria Madonia and Antonio Restivo, On ambiguity of two-dimensional languages

11:30-12:00

Pascal Ochem and Tony Reix, Upper bound on the number of ternary square-free words [Cancelled]

Roman Kolpakov, On the number of repetition-free words

12:00-13:40

Lunch break (Lunch will be served at 12:20 in Bogart's Cafe, Malaya Konyushennaya st. 14/19)

13:40-16:00 Third Session. Chair: Jean Berstel

13:40-14:20

Invited talk: Sergey Avgustinovich (Sobolev Institute of Mathematics, Novosibirsk, Russia), Some open problems on factorial languages

14:25-14:45

Akim Demaille, Sylvain Lombardy and Jacques Sakarovitch, Weighted automata and transducers in Vaucanson

14:50-15:10

George Rahonis and Manfred Droste, Weighted automata and weighted logics

15:15-15:35

Greg Budzban and Philip Feinsilver, A vector space approach to the road coloring problem

15:40-16:00 Thierry Monteil, Estimating the number of ergodic measures of a minimal subshift knowing the geometry of its Rauzy graphs

16:00-16:20

Coffee break

16:20-18:00 Student Session. Chair: Sergey Avgustinovich

16:20-16:30

Thomas Fernique, Substitutions of stepped surfaces

16:35-16:45 Yuri Pritykin, Strongly almost periodic sequences, finite automata and algorithmic undecidability
16:50-17:00 Petr Ambroz, Palindromic complexity of infinite words associated with simple Parry numbers (joint work with C. Frougny, Z. Masakova and E. Pelantova)

17:05-17:15

Pavel Martyugin, Lower bounds for length of carefully synchronizing words

17:20-17:30

Adam Roman, Synchronization of finite automaton. Computations for different alphabet sizes

17:35-17:45

Yulia Zaks, Synchronizing automata with a letter of deficiency 2 (joint work with D. Ananichev and M. Volkov)

17:50-18:00

Ilya Petrov, Mirror images of 2-synchronizing words

18:00-20:00 CSR-2006 REGISTRATION (room 201) AND WELCOMING RECEPTION (next to room 208)