Constant-delay enumeration for SLP-compressed documents

We study the problem of enumerating results from a query over a compressed document. The model we use for compression are straight-line programs (SLPs), which are defined by a context-free grammar that produces a single string. For our queries, we use a model called Annotated Automata, an extension...

Celý popis

Podrobná bibliografia

Vydané v:	Logical methods in computer science Ročník 21, Issue 1
Hlavní autori:	Muñoz, Martín, Riveros, Cristian
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Logical Methods in Computer Science e.V 01.01.2025
Predmet:	computer science - data structures and algorithms computer science - formal languages and automata theory computer science - logic in computer science
ISSN:	1860-5974, 1860-5974
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!