Publisher
Springer Berlin Heidelberg
Reference8 articles.
1. Beauquier D. (1986) Ensembles homogènes minces.
2. 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.
3. Blanchard F., Hansel G. (1984) Languages and subshifts, Lecture Notes in Computer Science, 192, 138–146.
4. Eilenberg S. (1974), Automata, Languages and Machines, Vol. A, Academic Press.
5. Fisher R. (1975), Sofic systems and graphs. Monants. Math. 80, 179–186.
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Languages obtained from infinite words;RAIRO - Theoretical Informatics and Applications;1997
2. Minimal automation for a factorial, transitive, and rational language;Theoretical Computer Science;1989-09
3. Codes and automata;Lecture Notes in Computer Science