Accepting Conditions for Automata on omega-Languages
暂无分享,去创建一个
Abstract In this paper we study the ω-languages accepted by finite automata under a new type of accepting conditions which are based on whether the automaton enters all of its accepting states infinitely many times or not. We investigate the classes of ω-languages defined thereby in relation to other well-known subclasses of the class of ω-regular languages.
[1] Klaus W. Wagner,et al. On omega-Regular Sets , 1979, Inf. Control..
[2] Ludwig Staiger,et al. Automatentheoretische und automatenfreie Charakterisierungen topologischer Klassen regulärer Folgenmengen , 1974, J. Inf. Process. Cybern..
[3] Masako Takahashi,et al. A Note on omega-Regular Languages , 1983, Theor. Comput. Sci..