On the Power of Finite Automata with Both Nondeterministic and Probabilistic States.
Anne CondonLisa HellersteinSamuel PottleAvi WigdersonPublished in: SIAM J. Comput. (1998)
Keyphrases
- finite automata
- finite automaton
- probability function
- deterministic automata
- grammatical inference
- probabilistic automata
- regular expressions
- tree automata
- probabilistic model
- hidden markov models
- bayesian networks
- regular languages
- finite state machines
- database systems
- information theoretic
- computational model
- probabilistic context free grammars