Finitely Generated (Omega)o-Languages

Abstract Let R ⊂ X ∗ be a rational language. We prove that one can decide whether Rω is finitely generated, that is, whether Rω = Fω for some finite set F.

[1]  Robert McNaughton,et al.  Testing and Generating Infinite Sequences by a Finite Automaton , 1966, Inf. Control..

[2]  Maurice Nivat,et al.  Adherences of Languages , 1980, J. Comput. Syst. Sci..

[3]  Maurice Nivat,et al.  Sur les ensembles de mots infins engendrés par une grammaire algébrique , 1978, RAIRO Theor. Informatics Appl..