9.00: Conference registration

10.00: Conference opening.

10.00 -11.00: Tom C. Brown (Simon Fraser University, Burnaby, BC, Canada)
"Applications of standard Sturmian words to elementary number theory"

11.00-12.00: Aldo de Luca (University of Roma, "La Sapienza", Italy)
"Words and special factors"

14.00-15.00: Giuseppe Pirillo (CNR, University of Firenze, Italy)
"A new characteristic property of Standard Sturmian words"

15.00-16.00: Julien Cassaigne (CNRS, Mathematic Institute of Luminy, France)
"Ideas for a proof of Rauzy's conjecture on the recurrence function of infinite words"

16.00: Break

17.00-17.45: Rosalba Zizza (University of Milano, Italy)
"Linear and circular splicing"

17.45-18.30: Laurent Vuillon ( Paris 7 University, France)
"A characterization of Sturmian words by return words"

8.40-9.40: Antonio Restivo (University of Palermo, Italy)
"Words and forbidden factors"

9.40-10.40: Jean Néraud (University of Rouen, France)
"On quasi-complete sets"

10.40: Break

11.00-11.45: Arto Lepistø (University of Turku, Finland)
Periodicity on infinite words

11.45-12.30: Laurent Mouchard (University of Rouen and King College of London, Great Britain)
"Distributed pattern matching"

14.30-15.30: Juhani Karhumaki (University of Turku, Finland)
"The commutation of finite sets: a challenging problem"

15.30-16.30: Gérard Jacob (Lille 1 University, France)
"Polynômes non commutatifs et Systèmes dynamiques".

16.30: Break

17.00-17.45: Jean Gabriel Luque (University of Rouen, France)
"On the support of free partially commutative Lie Algebra"

17.45-18.30: Vadim Malyshev (INRIA, Rocquencourt, France)
"Random and Quantum Evolution of Words"

9.00-10.00: Jean Berstel (University of Marne la Vallée, France)
"Shuffle factorization is unique"

10: Break

10.30-11.15: Roberto Incitti (University of Bologna, Italy)
"The growth of context-free languages"

11.15-12.00: Yannick Guesnet (University of Rouen, France)
"On codes with a finite interpreting delay"

14.30: Excursion in the Fine Art Museum of Rouen.

20.30: Conference Dinner : Restaurant "la Couronne", Place du Vieux Marché, Rouen

9.10-10.10: Robert Tijdeman (University of Leiden, The Netherlands)
" On the minimal complexity of infinite words"

10.10: Break

10.30-11.15: Jano Manuch (University of Turku, Finland)
"Multiple factorisations of Words and Defect Effect"

11.15-12.00: Yoan J. Pinzon (King's College London, Great Britain)
"Algorithms for Computing Approximate Repetitions in Musical Sequences"

14.00-15.00: Jean Paul Allouche (CNRS, Paris 11 University, Orsay, France) "À propos d'un résultat de S. Lehr sur les nombres réels automatiques"

15.00-16.00: Gérard Cohen (ENST, Paris, France)
"Codes pour la protection de droits d'auteur"

16.00: Break

16.30-17.15: Wojcieh Plandowski (University of Varsow, Polland)
"On complexity of satisfiability of word equations"

17.15-18.00: Alex Heinis (University of Leiden, The Netherlands)
"The values of P(n)/n for biinfinite words"

18.00-18.45: Valérie Berthé (CNRS, University of Marseille, France)
"Complexité des automates cellulaires"

8.40-9.40: Mireille Régnier (INRIA Rocquencourt, France)
"Efficient Computation of Unusual Words Expectation"

9.40-10.40: Arturo Carpi (Istituto di Cibernetica del CNR, Arco Felice, Italy)
"On special factors of rational trees and ultimately periodic words"

10.40: Break

11.00-11.45: Zoltán Ésik (Jozsef Attila University of Szeged, Hungary)
"Axiomatizing the subsumption order on finite and infinite partial words"

11.45-12.30: Francis Wlazinski (University of Picardie Jules Verne, Amiens France) "Test-Sets for Cube-Free Morphisms"

14.30-15.30: Guy Melancon (CWI, Amsterdam, The Netherlands)
"Conjugation, Lyndon Words and an Application to free Lie algebras"

15.30-16.30: Christian Mauduit (University of Marseille, France)
"Pseudo-random finite and infinite words"

16.30: Break

16.45-17.00: Flavio D'Allessandro (Paris 7 University, France)
"A combinatorial problem on trapezoidal words"

17.30-18.00: Roman Kolpakov (Moscow University , Russia)
"On finding squares with constant gap"

18. 00-18.30: Yuriy Tarannikov ( Moscow University, Russia)
"On letter density in infinite repetition-free words"

09.00-10.00: Filippo Mignosi (University of Palermo, Italy)
"From local versus global bidimensional periodicities"

10.00: Break

10.30-11.15: Cyril Nicaud (Paris 7 University, France)
"Complexité en moyenne des opérations sur les automates unaires"

11.15-12.00: Michael Bigotte (Lille 1 University, France)
"Lyndon words and shuffle algebras for generating the coloured multiple zeta values relations tables"

12.00: Closure of the conference.

"WORDS"

Conférences

Programme de la conférence "WORDS97"

Plan d'accés à la conférence