THE COMPLEMENTATION PROBLEM FOR BUCHI AUTOMATA WITH APPLICATIONS TO TEMPORAL LOGIC

[1] EQUIVALENCE OF INFINITE BEHAVIOR OF FINITE AUTOMATA [J]. THEORETICAL COMPUTER SCIENCE, 1984, 31 (03) : 297 - 306

[2] Buchi J.R, 1973, LECT NOTES MATH, V328, P1

[3] BUCHI JR, 1962, 1960 P INT C LOG MET, P1

[4] THEORIES OF AUTOMATA ON OMEGA-TAPES - SIMPLIFIED APPROACH [J]. JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 1974, 8 (02) : 117 - 141

[5] Eilenberg S., 1974, AUTOMATA LANGUAGES M, VA

[6] Gabbay D., 1980, POPL 80 PROC 7 ACM S, P163, DOI [10.1145/567446.567462, DOI 10.1145/567446.567462]

[7] PROCESS LOGIC - EXPRESSIVENESS, DECIDABILITY, COMPLETENESS [J]. JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 1982, 25 (02) : 144 - 170

[8] MANNA Z, 1981, CORRECTNESS PROBLEM, P215

[9] TESTING AND GENERATING INFINITE SEQUENCES BY A FINITE AUTOMATON [J]. INFORMATION AND CONTROL, 1966, 9 (05): : 521 - +

[10] MEYER A, 1972, 13TH P ANN IEEE S SW, P125, DOI DOI 10.1109/SWAT.1972.29

[1] EQUIVALENCE OF INFINITE BEHAVIOR OF FINITE AUTOMATA [J]. THEORETICAL COMPUTER SCIENCE, 1984, 31 (03) : 297 - 306

[2] Buchi J.R, 1973, LECT NOTES MATH, V328, P1

[3] BUCHI JR, 1962, 1960 P INT C LOG MET, P1

[4] THEORIES OF AUTOMATA ON OMEGA-TAPES - SIMPLIFIED APPROACH [J]. JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 1974, 8 (02) : 117 - 141

[5] Eilenberg S., 1974, AUTOMATA LANGUAGES M, VA

[6] Gabbay D., 1980, POPL 80 PROC 7 ACM S, P163, DOI [10.1145/567446.567462, DOI 10.1145/567446.567462]

[7] PROCESS LOGIC - EXPRESSIVENESS, DECIDABILITY, COMPLETENESS [J]. JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 1982, 25 (02) : 144 - 170

[8] MANNA Z, 1981, CORRECTNESS PROBLEM, P215

[9] TESTING AND GENERATING INFINITE SEQUENCES BY A FINITE AUTOMATON [J]. INFORMATION AND CONTROL, 1966, 9 (05): : 521 - +

[10] MEYER A, 1972, 13TH P ANN IEEE S SW, P125, DOI DOI 10.1109/SWAT.1972.29