Probabilities to accept languages by quantum finite automata
Andris AmbainisRichard F. BonnerRusins FreivaldsArnolds KikustsPublished in: CoRR (1999)
Keyphrases
- finite automata
- grammatical inference
- regular languages
- probability function
- probabilistic automata
- deterministic automata
- regular expressions
- inductive inference
- context free
- tree automata
- context free grammars
- probability distribution
- finite automaton
- belief networks
- hidden markov models
- finite state automata
- pattern matching
- natural language processing
- positive data
- knowledge base
- artificial intelligence
- databases