Conjunctive Grammars and Alternating Pushdown Automata.
Tamar AizikowitzMichael KaminskiPublished in: WoLLIC (2008)
Keyphrases
- finite state automata
- context free
- automata theoretic
- grammatical inference
- finite automata
- model checking
- context free grammars
- temporal logic
- finite state
- probabilistic automata
- finite state machines
- regular languages
- tree automata
- formal languages
- timed automata
- tree grammars
- visual languages
- cellular automata
- syntactic pattern recognition
- regular expressions
- parse selection
- closely related
- inductive logic programming systems
- mildly context sensitive
- stochastic grammar
- graph grammars
- grammar induction
- phrase structure
- context sensitive
- natural language processing
- turing machine
- closure properties
- real time
- context dependent
- natural language
- data sets
- lattice gas