Publisher
Springer Berlin Heidelberg
Reference18 articles.
1. A. Carpi, Overlap-free words and finite automata, Theoret. Comput. Sci.115 (1993), 243–260.
2. J. Cassaigne, Counting overlap-free binary words, in: STACS'93, Enjalbert, Finkel, Wagner (eds), Lect. Notes Comp. Sci., 665, Springer-Verlag, 1993, 216–225.
3. K. Culik II and A. Salomaa, On infinite words obtained by iterating morphisms, Theoret. Comput. Sci.19 (1982), 29–38.
4. E. D. Fife, Binary sequences which contain no BBb, Trans. Amer. Math. Soc.261 (1980), 115–136.
5. T. Harju, On cyclically overlap-free words in binary alphabets, The Book of L, Springer-Verlag, 1986, 123–130.
Cited by
5 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Square-Free Words over Partially Commutative Alphabets;Language and Automata Theory and Applications;2015
2. Fife's Theorem for (7/3)-Powers;Electronic Proceedings in Theoretical Computer Science;2011-08-17
3. Fife’s Theorem Revisited;Developments in Language Theory;2011
4. Infinite words containing squares at every position;RAIRO - Theoretical Informatics and Applications;2010-01
5. Combinatorics of Words;Handbook of Formal Languages;1997