论文信息 - Language-Theoretical Representations of omega-Languages

Language-Theoretical Representations of omega-Languages

Abstract In this paper, we give language-theoretical representations for some classes of ω- languages defined by finite automata. The classes considered in this paper are proved to be the classes of ω-languages represented as F ′ F ω , PF ω or P ′ P ω , where P and P ′ are prefix-free regular languages and F and F ′ are prefix-free finite languages.

Hideki Yamasaki

[1] J. R. Büchi. On a Decision Method in Restricted Second Order Arithmetic , 1990 .

[2] Klaus W. Wagner,et al. On omega-Regular Sets , 1979, Inf. Control..

[3] Tetsuo Moriya,et al. Accepting Conditions for Automata on omega-Languages , 1988, Theor. Comput. Sci..

[4] Masako Takahashi,et al. A Note on omega-Regular Languages , 1983, Theor. Comput. Sci..