Unambiguous Büchi automata
暂无分享,去创建一个
[1] Pierre Wolper,et al. The Complementation Problem for Büchi Automata with Appplications to Temporal Logic , 1987, Theor. Comput. Sci..
[2] Dominique Perrin,et al. Finite Automata , 1958, Philosophy.
[3] J. Howie. Fundamentals of semigroup theory , 1995 .
[4] Lawrence H. Landweber,et al. Decision problems forω-automata , 1969, Mathematical systems theory.
[5] Wolfgang Thomas,et al. Automata on Infinite Objects , 1991, Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics.
[6] David E. Muller,et al. Infinite sequences and finite machines , 1963, SWCT.
[7] Moshe Y. Vardi. An Automata-Theoretic Approach to Linear Temporal Logic , 1996, Banff Higher Order Workshop.
[8] Andrzej Wlodzimierz Mostowski. Determinancy of Sinking Automata on Infinite Trees and Inequalities Between Various Rabin's Pair Indices , 1982, Inf. Process. Lett..
[9] Danièle Beauquier,et al. Codeterministic Automata on Infinite Words , 1985, Inf. Process. Lett..
[10] B. Tilson. On the complexity of finite semigroups , 1974 .
[11] Jean-Camille Birget,et al. Iteration of expansions — unambiguous semigroups , 1984 .
[12] M. Rabin. Decidability of second-order theories and automata on infinite trees. , 1969 .
[13] Jeffrey D. Ullman,et al. Introduction to Automata Theory, Languages and Computation , 1979 .
[14] Robert McNaughton,et al. Testing and Generating Infinite Sequences by a Finite Automaton , 1966, Inf. Control..
[15] André Arnold. Rational omega-Languages are Non-Ambiguous , 1983, Theor. Comput. Sci..
[16] Raymond E. Miller,et al. Varieties of Formal Languages , 1986 .