Probabilities to Accept Languages by Quantum Finite Automata.
Andris AmbainisRichard F. BonnerRusins FreivaldsArnolds KikustsPublished in: COCOON (1999)
Keyphrases
- finite automata
- grammatical inference
- regular languages
- probability function
- deterministic automata
- regular expressions
- probabilistic automata
- context free
- inductive inference
- context free grammars
- probability distribution
- hidden markov models
- tree automata
- belief networks
- finite automaton
- data mining
- databases
- building blocks
- query language
- query processing
- natural language