About rational sets of factors of a bi-infinite word

This publication has 6 references indexed in Scilit:

• Bornes inferieures sur la complexite des facteurs des mots infinis engendres par morphismes iteres
  Lecture Notes in Computer Science, 1984
• Ensembles reconnaissables de mots biinfinis
  Published by Association for Computing Machinery (ACM) ,1982
• A combinatorial approach to the theory of ω-automata
  Information and Control, 1981
• Sofic systems and graphs
  Monatshefte für Mathematik, 1975
• Subword complexities of various classes of deterministic developmental languages without interactions
  Theoretical Computer Science, 1975
• Testing and generating infinite sequences by a finite automaton
  Information and Control, 1966