LR(0) conjunctive grammars and deterministic synchronized alternating pushdown automata.
Tamar AizikowitzMichael KaminskiPublished in: J. Comput. Syst. Sci. (2016)
Keyphrases
- finite state automaton
- finite state automata
- turing machine
- context free
- logistic regression
- finite state
- finite automata
- grammatical inference
- model checking
- cellular automata
- probabilistic automata
- natural language
- low resolution
- context free grammars
- deterministic finite automata
- visual languages
- regular languages
- automata theoretic
- finite state machines
- black box
- markov chain
- super resolution
- inductive inference
- machine learning
- data sets
- parse selection
- tree grammars
- neural network
- finite automaton
- data model
- information extraction
- formal languages
- phrase structure
- motion estimation
- natural language processing
- temporal logic
- regular expressions