Computing the longest common prefix of a context-free language in polynomial time.
Michael LuttenbergerRaphaela PalentaHelmut SeidlPublished in: CoRR (2017)
Keyphrases
- context free
- tree languages
- context dependent
- context sensitive
- context free languages
- grammatical inference
- finite state
- attribute grammars
- inductive inference
- context free grammars
- graph grammars
- phrase structure
- regular languages
- grammar rules
- natural language
- finite automata
- parse tree
- tree automata
- positive data
- knowledge based systems
- machine learning