Berstel, Jean Sur les mots sans carre definis par un morphisme. (French) Zbl 0425.20046 Automata, languages and programming, 6th Colloq., Graz 1979, Lect. Notes Comput. Sci. 71, 16-25 (1979). Page: −5 −4 −3 −2 −1 ±0 +1 +2 +3 +4 +5 Show Scanned Page Cited in 23 Documents MSC: 20M05 Free semigroups, generators and relations, word problems 20F10 Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) 20M35 Semigroups in automata theory, linguistics, etc. 03D40 Word problems, etc. in computability and recursion theory 08A50 Word problems (aspects of algebraic structures) 68T99 Artificial intelligence Keywords:infinite nonrepetitive words; free monoid Citations:Zbl 0401.00015 PDF BibTeX XML OpenURL