Deterministic Two-Way Restarting Automata and Marcus Contextual Grammars.
Tomasz JurdzinskiFriedrich OttoFrantisek MrázMartin PlátekPublished in: Fundam. Informaticae (2005)
Keyphrases
- context free
- finite state automaton
- finite state automata
- context dependent
- context sensitive
- turing machine
- finite automata
- grammatical inference
- deterministic finite automata
- context free languages
- natural language
- contextual information
- regular languages
- black box
- regular expressions
- cellular automata
- probabilistic automata
- visual languages
- relaxation algorithm
- context free grammars
- tree bank
- finite state
- tree grammars
- lattice gas
- parse selection
- stochastic grammar
- database
- formal languages
- natural language processing
- website
- information systems
- artificial intelligence