The minimal probabilistic and quantum finite automata recognizing uncountably many languages with fixed cutpoints.
Aleksejs NaumovsMaksims DimitrijevsAbuzer YakaryilmazPublished in: Discret. Math. Theor. Comput. Sci. (2020)
Keyphrases
- finite automata
- grammatical inference
- regular languages
- probability function
- probabilistic automata
- deterministic automata
- regular expressions
- tree automata
- databases
- bayesian networks
- probabilistic model
- finite automaton
- knowledge representation
- probabilistic context free grammars
- hidden markov models
- context sensitive