Login / Signup
On the Power of Las Vegas for One-way Communication Complexity, Finite Automata, and Polynomial-time Computations
Pavol Duris
Juraj Hromkovic
José D. P. Rolim
Georg Schnitger
Published in:
Electron. Colloquium Comput. Complex. (1997)
Keyphrases
</>
finite automata
deterministic automata
probabilistic automata
regular expressions
grammatical inference
tree automata
computational complexity
hidden markov models
pattern matching
decision problems