Complementing deterministic Büchi automata in polynomial time

This publication has 9 references indexed in Scilit:

• The complementation problem for Büchi automata with applications to temporal logic
  Theoretical Computer Science, 1987
• Modelling concurrent processes
  Proceedings of Symposia in Applied Mathematics, 1985
• Synthesis of Communicating Processes from Temporal Logic Specifications
  ACM Transactions on Programming Languages and Systems, 1984
• Aho, A. V. / Hopcroft, J. E. / Ullman, J. D., The Design and Analysis of Computer Algorithms. London‐Amsterdam‐Don Mills‐Sydney. Addison‐Wesley Publ. Comp. 1974 X, 470 S., $ 24,–
  ZAMM - Journal of Applied Mathematics and Mechanics / Zeitschrift für Angewandte Mathematik und Mechanik, 1979
• Theories of automata on ω-tapes: A simplified approach
  Journal of Computer and System Sciences, 1974
• Automata on Infinite Objects and Church’s Problem
  CBMS Regional Conference Series in Mathematics, 1972
• Decidability of Second-Order Theories and Automata on Infinite Trees
  Transactions of the American Mathematical Society, 1969
• 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