Non-returning PC Grammar Systems Generate any Recursively Enumerable Language with Eight Context-Free Components.
György VaszilPublished in: J. Autom. Lang. Comb. (2007)
Keyphrases
- context free
- inductive inference
- context dependent
- context sensitive
- grammar rules
- grammatical inference
- context free grammars
- phrase structure
- natural language
- attribute grammars
- graph grammars
- probabilistic context free grammars
- finite state
- parse tree
- knowledge based systems
- high level
- information extraction
- recursive functions
- low level
- information retrieval