Fingerprint
Dive into the research topics of 'Computing the longest common prefix of a context-free language in polynomial time'. Together they form a unique fingerprint.- Sort by
- Weight
- Alphabetically
Computing the longest common prefix of a context-free language in polynomial time
Michael Luttenberger, Raphaela Palenta, Helmut Seidl
Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review
5
Scopus
citations