Oracle Pushdown Automata, Nondeterministic Reducibilities, and the Hierarchy over the Family of Context-Free Languages.
Tomoyuki YamakamiPublished in: SOFSEM (2014)
Keyphrases
- context free languages
- finite automata
- regular languages
- context free
- finite state
- grammatical inference
- regular expressions
- model checking
- markov chain
- context free grammars
- decision problems
- statistical queries
- special case
- context sensitive
- pattern matching
- positive data
- inductive inference
- context dependent
- finite state machines
- database
- data management
- pac learning
- biological sequences
- positive and negative
- optimal policy
- hidden markov models
- reinforcement learning