Quantum Finite Automata and Probabilistic Reversible Automata: R-trivial Idempotent Languages.
Marats GolovkinsMaksim KravtsevVasilijs KravcevsPublished in: MFCS (2011)
Keyphrases
- finite automata
- grammatical inference
- regular languages
- probabilistic automata
- probability function
- regular expressions
- deterministic automata
- tree automata
- finite automaton
- cellular automata
- inductive inference
- positive data
- hidden markov models
- information theoretic
- markov chain
- context free grammars
- context free
- pattern matching