When is Containment Decidable for Probabilistic Automata?
Laure DaviaudMarcin JurdzinskiRanko LazicFilip MazowieckiGuillermo A. PérezJames WorrellPublished in: CoRR (2018)
Keyphrases
- probabilistic automata
- query containment
- finite automata
- transitive closure
- regular expressions
- conjunctive queries
- markov chain
- relative entropy
- query answering
- finite state automata
- datalog programs
- sound theoretical
- regular path queries
- query evaluation
- query language
- grammatical inference
- regular languages
- data exchange
- mixture model