(0) Conjunctive Grammars and Deterministic Synchronized Alternating Pushdown Automata.
Tamar AizikowitzMichael KaminskiPublished in: CSR (2011)
Keyphrases
- finite state automaton
- finite state automata
- context free
- turing machine
- context free grammars
- finite automata
- finite state
- automata theoretic
- deterministic finite automata
- regular expressions
- finite state machines
- grammatical inference
- probabilistic automata
- cellular automata
- model checking
- tree automata
- visual languages
- lattice gas
- closely related
- natural language
- grammar induction
- stochastic grammar
- neural network
- tree grammars
- mildly context sensitive
- closure properties
- black box
- natural language processing
- lower bound
- information retrieval