Login / Signup
On the Succinctness of Deterministic, Nondeterministic, Probabilistic and Quantum Finite Automata.
Carlo Mereghetti
Beatrice Palano
Giovanni Pighizzini
Published in:
DCFS (2001)
Keyphrases
</>
finite automata
deterministic automata
probability function
regular expressions
probabilistic automata
grammatical inference
hidden markov models
finite automaton
bayesian networks
tree automata
regular languages
information theoretic