The complementation problem for Büchi automata with applications to temporal logic
- 7 June 2005
- book chapter
- conference paper
- Published by Springer Science and Business Media LLC
- p. 465-474
- https://doi.org/10.1007/bfb0015772
Abstract
No abstract availableKeywords
This publication has 19 references indexed in Scilit:
- Improved upper and lower bounds for modal logics of programsPublished by Association for Computing Machinery (ACM) ,1985
- Equivalence of infinite behavior of finite automataTheoretical Computer Science, 1984
- Process logic: Expressiveness, decidability, completenessJournal of Computer and System Sciences, 1982
- The temporal semantics of concurrent programsTheoretical Computer Science, 1981
- Descriptively complete process logicActa Informatica, 1980
- Theories of automata on ω-tapes: A simplified approachJournal of Computer and System Sciences, 1974
- Structure of complexity in the weak monadic second-order theories of the natural numbersPublished by Association for Computing Machinery (ACM) ,1974
- Weakly Definable Relations and Special AutomataPublished by Elsevier BV ,1970
- Testing and generating infinite sequences by a finite automatonInformation and Control, 1966
- Finite Automata and Their Decision ProblemsIBM Journal of Research and Development, 1959