When is Containment Decidable for Probabilistic Automata?.
Laure DaviaudMarcin JurdzinskiRanko LazicFilip MazowieckiGuillermo A. PérezJames WorrellPublished in: ICALP (2018)
Keyphrases
- probabilistic automata
- query containment
- finite automata
- transitive closure
- conjunctive queries
- regular expressions
- relative entropy
- markov chain
- query answering
- datalog programs
- finite state automata
- sound theoretical
- regular path queries
- query evaluation
- metadata
- data exchange
- pattern matching
- finite state machines
- xml schema
- integrity constraints
- probabilistic model
- query language
- reinforcement learning
- learning algorithm