Pushdown Automata on Infinite Trees and Nondeterministic Context-Free Programs.
Ahmed SaoudiPublished in: Int. J. Found. Comput. Sci. (1992)
Keyphrases
- context free
- finite state
- tree automata
- model checking
- regular languages
- tree languages
- finite automata
- markov chain
- grammatical inference
- attribute grammars
- context sensitive
- context dependent
- markov decision processes
- optimal policy
- finite state machines
- context free grammars
- graph grammars
- decision trees
- grammar rules
- inductive inference
- regular expressions
- metadata
- state space
- information retrieval