Publisher
Springer Berlin Heidelberg
Reference6 articles.
1. Beauquier D., Nivat M. (1985) About rational sets of factors of a bi-infinite word. Lecture Notes in Computer Science 194, 33–42 ICALP 85.
2. Ehrenfeucht A., Lee K.L., Rozenberg G. (1975) Subword complexities of various classes of deterministic developmental languages without interactions. Theoretical Computer Science 1, 59–75.
3. Ethan M. Coven, Headlund G.A. (1973) Sequences with Minimal Block Growth. Math System Theory 7, 138–153.
4. Lothaire M. (1983) Combinatorics on Words Encyclopedia of Mathematics and its applications, 17, 1–13.
5. Nivat M., Perrin D. (1982), Ensembles reconnaissables de mots bi-infinis Proc. 14th A.C.M. Symp. on Theory of Computing, 47–59.
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Languages obtained from infinite words;RAIRO - Theoretical Informatics and Applications;1997
2. Factors of words;Automata, Languages and Programming;1989