Non-recursive trade-offs between two-dimensional automata and grammars.
Daniel PrusaPublished in: Theor. Comput. Sci. (2016)
Keyphrases
- trade off
- context free
- finite state automata
- three dimensional
- grammatical inference
- finite automata
- cellular automata
- multi dimensional
- regular languages
- context free grammars
- natural language
- context free languages
- probabilistic automata
- turing machine
- finite state
- mildly context sensitive
- formal languages
- tree grammars
- real time
- grammar rules
- finite state machines
- context dependent
- natural language processing
- hidden markov models
- reinforcement learning
- computer vision
- machine learning