Computing the Longest Common Prefix of a Context-free Language in Polynomial Time.
Michael LuttenbergerRaphaela PalentaHelmut SeidlPublished in: STACS (2018)
Keyphrases
- context free
- tree languages
- context dependent
- context sensitive
- context free languages
- grammatical inference
- context free grammars
- finite state
- attribute grammars
- graph grammars
- phrase structure
- grammar rules
- inductive inference
- markov chain
- information extraction
- language model
- probabilistic context free grammars
- tree automata
- positive data
- natural language
- parse tree
- finite automata
- state space
- xml documents