Minimal forbidden words and symbolic dynamics

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

Volumn 1046, Issue , 1996, Pages 555-566

  Béal, Marie Pierre ^a   Mignosi, Filippo ^b   Restivo, Antonio ^b  

^a UNIVERSITÉ PIERRE ET MARIE CURIE   (France)

^b UNIVERSITY OF PALERMO   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

FORMAL LANGUAGES;

COMBINATORIAL PROPERTIES; COMPLEXITY MEASURES; MINIMAL FORBIDDEN WORDS; SYMBOLIC DYNAMICS; TOPOLOGICAL INVARIANTS;

DYNAMICAL SYSTEMS;

EID: 84948146400     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-60922-9_45     Document Type: Conference Paper

References (18)

1. R. Adler, D. Coppersmith, M. Hassner. Algorithms for Sliding-Block Codes, IEEE Trans. Inf. Theory, IT-29 (1983), 5-22.
2. R. Badii. Quantitave Characterization of Complexity and Predictability, Physics Letters A 160 (1991), 372-377.
3. R. Badii. Complexity and Unpredictable Scaling of Hierarchical Structures, in "Chaotic Dynamics: Theory and Practice," T. Bountis Ed., Plenum Press, New York, 1992.
4. M. P. Béal. Codage Symbolique, Masson, 1993.
5. J. Berstel. Fibonacci Words-α Survey, in "The Book of L," G. Rozenberg, A. Salomaa eds., Springer Verlag 1986.
6. J. Cassaigne. Complexité et Facteurs Spéciaux, Actes des Journées Montoises, 1994.
7. A. de Luca, F. Mignosi. Some Combinatorial Properties of Sturmian Words, Theor. Comp. Science, 136 (1994), 361-385.
8. A. de Luca, L. Mione. On Bispecial Factors of the Thue-Morse Word, Inf. Proc. Lett., 49 (1994), 179-183.
9. S. Eilenberg. Automata, Languages, Machines, Vol. A, Academic Press, 1974.
10. G. A. Hedlund. Endomorphisms and Autorphisms of the Shift Dynamical System, Math. System Theory, 3 (1969), 320-375.
11. K. H. Kim, F. W. Roush. Williams Conjecture is False for Reducible Matrices, J. Amer. Math. Soc. 5 (1992), 213-125.
12. M. Lothaire. Combinatorics on Words, Addison-Wesley, Reading, MA 1983.
13. H. A. Maurer, M. Nivat. Rational bijections of rational sets, Acta Informatica 13 (1980), 365-378.
14. R. McNaughton, S. Papert. Counter-Free Automata, M.I.T. Press, MA 1970.
15. M. Morse. Recurrent geodesics on a surface of negative curvature, Trans. Amer. Math. Soc. 22 (1921), 84-110.
16. D. Perrin. Symbolic Dynamics and Finite Automata, invited lecture in Proc. MFCS'95, Lect. Notes in Comp. Sci., 969.
17. G. Rauzy, Mots infinis en arithmétique in "Automata on Infinite words," M. Nivat and D. Perrin eds., Lecture Notes in Comp. Science, 192, Springer, Berlin 1984.
18. R. Williams. Classification of shifts of finite type, Annals of Math., 98 (1973), 120-153. Errata, Annals of Math., 99 (1974), 380-381.