6533b871fe1ef96bd12d22a3
RESEARCH PRODUCT
Complexity of probabilistic versus deterministic automata
Rusins Freivaldssubject
Finite-state machineNested wordTheoretical computer scienceDFA minimizationDeterministic automatonComputer scienceDeterministic context-free grammarAutomata theoryQuantum finite automataProbabilistic analysis of algorithmsyear | journal | country | edition | language |
---|---|---|---|---|
2005-11-22 |