Can Nondeterminism Help Complementation?
Complementation and determinization are two fundamental notions in automata theory. The close relationship between the two has been well observed in the literature. In the case of nondeterministic finite automata on finite words (NFA), complementation and determinization have the same state complexi...
Main Authors: | Yang Cai, Ting Zhang |
---|---|
Format: | Article |
Language: | English |
Published: |
Open Publishing Association
2012-10-01
|
Series: | Electronic Proceedings in Theoretical Computer Science |
Online Access: | http://arxiv.org/pdf/1110.5942v4 |
Similar Items
-
Parallelism with limited nondeterminism
by: Finkelstein, Jeffrey
Published: (2017) -
Teaching Nondeterminism Through Programming
by: Giora ALEXANDRON, et al.
Published: (2016-04-01) -
Refinement for Probabilistic Systems with Nondeterminism
by: David Streader, et al.
Published: (2011-06-01) -
Determinism, nondeterminism, alternation, and counting /
by: Gupta, Sanjay
Published: (1993) -
Nondeterminism and Language Design in Deep Inference
by: Kahramanogullari, Ozan
Published: (2007)