Ranked MSO-Enumeration Solved For Compressed Words
Researchers have demonstrated a solution for the ranked query enumeration problem using a fixed MSO-query on strings. The method achieves linear preprocessing and constant delay within grammar compression.
Topics
Developing
- 883d Lorem ipsum dolor sit amet, consectetur adipiscing elit, sed do eiusmod tempor incididunt ut labore.
- 883d Duis aute irure dolor in reprehenderit in voluptate velit esse cillum dolore eu fugiat nulla pariatur.
- 883d Excepteur sint occaecat cupidatat non proident, sunt in culpa qui officia deserunt mollit anim id est.
- 883d Sed ut perspiciatis unde omnis iste natus error sit voluptatem accusantium doloremque laudantium.
Sources · 7 independent
Modernity/arxiv
“Ranked MSO-enumeration over compressed words. Authors: Markus Lohrey Abstract: It is shown that the ranked query enumeration problem for a fixed MSO-query on strings can be solved with linear preprocessing and constant delay in the grammar-compr...”
Unlock the full story
Get a Pro subscription or above to see the live story progression and the full list of independent sources confirming each event as they happen.
Log in to upgrade