Two Ways of Introducing Alternation into Context-Free Grammars and Pushdown Automata.
Etsuro MoriyaFriedrich OttoPublished in: IEICE Trans. Inf. Syst. (2007)
Keyphrases
- context free grammars
- tree automata
- context free
- regular expressions
- regular languages
- formal languages
- grammatical inference
- context free languages
- syntactic pattern recognition
- closure properties
- finite automata
- attribute grammars
- pattern matching
- finite state
- grammar induction
- lexical semantics
- predicate invention
- query language
- covering arrays
- production rules
- context sensitive
- tree adjoining
- finite state machines
- xml schema
- model checking