When are emptiness and containment decidable for probabilistic automata?
Laure DaviaudMarcin JurdzinskiRanko LazicFilip MazowieckiGuillermo A. PérezJames WorrellPublished in: J. Comput. Syst. Sci. (2021)
Keyphrases
- probabilistic automata
- query containment
- finite automata
- transitive closure
- conjunctive queries
- relative entropy
- regular expressions
- markov chain
- query answering
- finite state automata
- datalog programs
- regular path queries
- sound theoretical
- query evaluation
- integrity constraints
- tree patterns
- maximum entropy
- data exchange
- state space
- hidden markov models
- objective function
- learning algorithm