The minimal probabilistic and quantum finite automata recognizing uncountably many languages with fixed cutpoints.
Aleksejs NaumovsMaksims DimitrijevsAbuzer YakaryilmazPublished in: CoRR (2019)
Keyphrases
- finite automata
- grammatical inference
- regular languages
- probability function
- deterministic automata
- probabilistic automata
- regular expressions
- tree automata
- context free
- bayesian networks
- context free grammars
- probabilistic model
- object oriented
- knowledge base
- databases
- finite automaton
- database
- inductive inference
- hidden markov models
- probabilistic context free grammars