Publisher
Springer Berlin Heidelberg
Reference5 articles.
1. BEAUQUIER D. 1984 Bi-limites de langages reconnaissables (à paraitre dans Theoretical Computer Science).
2. BEAUQUIER D. PERRIN D. 1984 Codeterministic automata on infinite words (à paraitre dans I.P.L)
3. EILENBERG S. 1974 Automata, languages dans machines vol. A Academic Press, New York.
4. NIVAT M. PERRIN D. 1982 Ensembles reconnaissables de mots bi-infinis Proc. 14th ACM Symp. on Theory of Computing 47–59.
5. PERRIN D. 1984 Recent results on automata and infinite words (à paraitre dans MFCS 84 — Springer).
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. On two-sided infinite fixed points of morphisms;Fundamentals of Computation Theory;1999
2. Logic, semigroups and automata on words;Annals of Mathematics and Artificial Intelligence;1996-12
3. Factors of words;Automata, Languages and Programming;1989