The complementation problem for Büchi automata with applications to temporal logic

This publication has 19 references indexed in Scilit:

• Improved upper and lower bounds for modal logics of programs
  Published by Association for Computing Machinery (ACM) ,1985
• Equivalence of infinite behavior of finite automata
  Theoretical Computer Science, 1984
• Process logic: Expressiveness, decidability, completeness
  Journal of Computer and System Sciences, 1982
• The temporal semantics of concurrent programs
  Theoretical Computer Science, 1981
• Descriptively complete process logic
  Acta Informatica, 1980
• Theories of automata on ω-tapes: A simplified approach
  Journal of Computer and System Sciences, 1974
• Structure of complexity in the weak monadic second-order theories of the natural numbers
  Published by Association for Computing Machinery (ACM) ,1974
• Weakly Definable Relations and Special Automata
  Published by Elsevier ,1970
• Testing and generating infinite sequences by a finite automaton
  Information and Control, 1966
• Finite Automata and Their Decision Problems
  IBM Journal of Research and Development, 1959