Decidability of cutpoint isolation for letter-monotonic probabilistic finite automata.
Paul C. BellPavel SemukhinPublished in: CoRR (2020)
Keyphrases
- finite automata
- probability function
- grammatical inference
- deterministic automata
- regular expressions
- probabilistic automata
- tree automata
- monotonicity constraints
- probabilistic model
- description logics
- regular languages
- query answering
- finite automaton
- bayesian networks
- hidden markov models
- expert systems
- production system