Keywords
Nondeterministic algorithmBüchi automatonNondeterministic finite automatonDeterministic automatonDiscrete mathematicsQuantum finite automataDeterministic finite automatonω-automatonMathematicsCorollaryCombinatoricsSuccinctnessAutomatonTime complexityAutomata theoryComputer scienceFinite-state machineAlgorithmTheoretical computer science
Affiliated Institutions
Related Publications
An Algorithm for the General Petri Net Reachability Problem
An algorithm is presented for the general Petri net reachability problem. It is based on a generalization of the basic reachability tree construction which is made symmetric wit...
New algorithms for finding irreducible polynomials over finite fields
We present a new algorithm for finding an irreducible polynomial of specified degree over a finite field. Our algorithm is deterministic, and it runs in polynomial time for fiel...
Oracle Quantum Computing
Abstract Building on the work of Deutsch and Jozsa, we construct oracles relative to which (1) there is a decision problem that can be solved with certainty in worst-case polyno...
Publication Info
- Year
- 1987
- Type
- article
- Volume
- 35
- Issue
- 1
- Pages
- 59-71
- Citations
- 50
- Access
- Closed
External Links
Social Impact
Altmetric
PlumX Metrics
Social media, news, blog, policy document mentions
Citation Metrics
50
OpenAlex
1
Influential
36
CrossRef
Cite This
Robert P. Kurshan
(1987).
Complementing deterministic Büchi automata in polynomial time.
Journal of Computer and System Sciences
, 35
(1)
, 59-71.
https://doi.org/10.1016/0022-0000(87)90036-5
Identifiers
- DOI
- 10.1016/0022-0000(87)90036-5