A Simple and Optimal Complementation Algorithm for Büchi Automata
Authors:
Open Access
- 9 July 2018
- conference paper
- Published by Association for Computing Machinery (ACM)
- p. 46-55
Abstract
No abstract availableKeywords
This publication has 6 references indexed in Scilit:
- Complementation, Disambiguation, and Determinization of Büchi Automata Unified2008
- A power-set construction for reducing Büchi automata to non-determinism degree twoInformation Processing Letters, 2007
- From Nondeterministic Buchi and Streett Automata to Deterministic Parity Automata2006
- Weak alternating automata are not that weakACM Transactions on Computational Logic, 2001
- On the complexity of omega -automata1988
- Preferential ArrangementsThe American Mathematical Monthly, 1962