PC grammar systems with five context-free components generate all recursively enumerable languages.
Erzsébet Csuhaj-VarjúGheorghe PaunGyörgy VaszilPublished in: Theor. Comput. Sci. (2003)
Keyphrases
- context free
- inductive inference
- grammatical inference
- context free grammars
- context sensitive
- context dependent
- finite state
- graph grammars
- attribute grammars
- grammar rules
- phrase structure
- knowledge based systems
- recursively enumerable
- recursive functions
- positive and negative
- parse tree
- learning tasks
- machine learning