Closure properties of subclasses of ω-regular languages under morphism and inverse morphism

References

• Büchi , J. R. 1960 . “ On a decision method in restricted second-order arithmetics ” . In Proc. of the Int. Congr. on Logic, Math. and Phil. of Sci. , Stanford, Calif : Standford Univ. Press .
   Google Scholar
• Culik , K. II and Pachl , J. K. 1981 . Equivalence problems for mappings on infinite strings . Inform, and Control , 49 : 52 – 63 .
   Google Scholar
• Gire F. Relations Rationnelles Infinitaires These de 3eme cycle Unive.de Paris 1981 VII
   Google Scholar
• Gire F. Une Extension Sux Mots Infinis de la Notion de Transduction Retionarelle Lecture Notes in Computer Science Springer, Berlin 1983 VII 123 139 6th GI Conf
   Google Scholar
• Latteux , M. and Timmerman , E. 1986 . Two characterizations of rational adherences . Theoret. Comput. Sci. , 46 : 101 – 106 .
   Google Scholar
• Moriya , T. and Yamasaki , H. 1988 . Accepting conditions for automata on ω-languages . Theoret. Comput. Sci. , 61 : 137 – 147 .
   Google Scholar
• Staiger , L. and Wagner , K. 1974 . Automatentheoreish und automatenfreie Characterisierngen topologishcher Klassen regularer Folgenmengen . EIK , 10 : 379 – 392 .
   Google Scholar
• Takahashi , M. and Yamasaki , H. 1983 . A note on ω-regular languages . Theoret. Comput. Sci. , 23 : 217 – 225 .
   Google Scholar
• Timmerman , E. 1990 . The three subfamilies of rational ω-languages closed under ω-transduction . Theoret. Comput. Sci. , 76 : 243 – 250 .
   Google Scholar
• Tison S. Mots infinis et processus: Objects infinitaires et topologies These de 3ieme cycle Universite de Lille 1983 1
   Google Scholar
• Yamasaki , H. 1989 . Language theoretical representations of ω-languages . Theoret. Comput. Sci. , 66 : 247 – 254 .
   Google Scholar