References
- Berstel , J. and Perrin , D. 1985 . Theory of codes , Academic Press .
- Boasson , L. and Nivat , M. 1980 . Adherences of Languages, Journal of Computer and System Sciences , 20 : 285 – 309 .
- Cobham , A. 1969 . On the base-dependence of sets of numbers recognizable by finite automata . Math. Systems Theory , 3 ( 2 ) : 186 – 192 .
- Eilenberg , S. 1974 . Automata, Languages, and Machines A , Academic Press .
- Hartmanis , J. and Shank , H. 1968 . On the recognition of primes by automata . J. ACM , 15 : 382 – 389 .
- Litovsky , I. 1991 . Prefix-free languages as ω-generators . Inform. Process. Lett. , 37 : 61 – 65 .
- Minsky , M. and Papert , S. 1966 . Unrecognizable sets of numbers . J. ACM , 13 ( 2 ) : 281 – 286 .
- Moriya , T. and Yamasaki , H. 1988 . Accepting conditions for automata on ω-words . Theoret. Comput. Sci. , 61 : 137 – 147 .
- Richie , R. W. 1963 . Finite automata and the set of squeres . J. ACM , 10 : 528 – 531 .
- Stutzenberger , M. P. 1968 . A remark on acceptable sets of numbers . J. ACM , 15 : 300 – 303 .
- Staiger , L. and Wagner , K. 1974 . Automatentheoretiche und automatenfreie Characteriseierungen topologischer Klassen regularer Folgenmengen . Elektron. Informationsverarb. Kybernet , 10 : 379 – 392 .
- Takahashi , M. and Yamasaki , H. 1983 . A note on ω-regular languages . Theoret. Comput. Sci. , 23 : 217 – 225 .
- Wagner , K. 1979 . On ω-regular sets . Inform and Control , 43 : 123 – 177 .
- Yamasaki , H. 1989 . Language-theoretical representations of ω-languages . Theoret. Comput. Sci. , 66 : 247 – 254 .