Checking Stacks and Context-Free Programmed Grammars Accept p-complete Languages.
Eli ShamirCatriel BeeriPublished in: ICALP (1974)
Keyphrases
- context free
- grammatical inference
- context sensitive
- context free languages
- context dependent
- context free grammars
- inductive inference
- finite state
- phrase structure
- grammar rules
- tree languages
- graph grammars
- closure properties
- regular languages
- information retrieval
- text classification
- natural language
- high level
- machine learning