On a conjecture of J. Shallit

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1256, Issue , 1997, Pages 693-704

  Cassaigne, Julien ^a  

^a AIX MARSEILLE UNIVERSITÉ   (France)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATA THEORY; ROBOTS;

SYMBOLIC SEQUENCE; UNARY LANGUAGES;

GRAPH THEORY;

EID: 21744453281     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-63165-8_223     Document Type: Conference Paper

References (10)

1. J.-P. Allouche and M. Bousquet-Mélou, On the conjectures of Rauzy and Shallit for infinite words, Comment. Math. Univ. Carolinae 36 (1995), 705-711.
2. P. Arnoux and G. Rauzy, Representation géométrique des suites de complexité 2n+ 1, Bull. Soc. Math. France 119 (1991), 199-215.
3. J. Cassaigne, A proof of Rauzy’s conjecture through an exhaustive study of factor graphs. In preparation.
4. J. Cassaigne, Facteurs spéciaux et complexité, Bull. Belg. Math. Soc. 4 (1997), 67-88. Special issue: Actes des Journées Montoises d’Informatique Théorique 1994.
5. M. Morse and G. A. Hedlund, Symbolic dynamics II: Sturmian trajectories, Amer. J. Math. 61 (1940), 1-42.
6. C. Pomerance, J. M. Robson, and J. Shallit, Automaticity II: Descriptional complexity in the unary case, Theoret. Comput. Sei. To appear.
7. G. Rauzy, Suites å termes dans un alphabet fini, Sém. de Theorie des Nombres de Bordeaux, 1982-1983, 2501-2516.
8. G. Rote, Sequences with subword complexity 2ra, J. Number Th. 46 (1994), 196-213.
9. J. Shallit and Y. Breitbart, Automaticity I: Properties of a measure of descriptional complexity, J. Comput. System Sei. 53 (1996), 10-25.
10. A. M. Vershik, Locally transversal symbolic dynamics, St. Petersburg Math. J. 6 (1995), 529-540.