Deterministic and non ambiguous rational omega-languages
暂无分享,去创建一个
[1] Samuel Eilenberg,et al. Automata, languages, and machines. A , 1974, Pure and applied mathematics.
[2] Ludwig Staiger,et al. Automatentheoretische und automatenfreie Charakterisierungen topologischer Klassen regulärer Folgenmengen , 1974, J. Inf. Process. Cybern..
[3] Robin Milner,et al. On Observing Nondeterminism and Concurrency , 1980, ICALP.
[4] André Arnold. Rational omega-Languages are Non-Ambiguous , 1983, Theor. Comput. Sci..
[5] George A. Miller,et al. Finite State Languages , 1958, Inf. Control..
[6] Ludwig Staiger,et al. Finite-State omega-Languages , 1983, J. Comput. Syst. Sci..
[7] E. Polak,et al. System Theory , 1963 .
[8] André Arnold. Topological Characterizations of Infinite Behaviours of Transition Systems , 1983, ICALP.