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...

Full description

Bibliographic Details

Published in:	Logical methods in computer science Vol. 21, Issue 1
Main Authors:	Muñoz, Martín, Riveros, Cristian
Format:	Journal Article
Language:	English
Published:	Logical Methods in Computer Science e.V 01.01.2025
Subjects:	computer science - data structures and algorithms computer science - formal languages and automata theory computer science - logic in computer science
ISSN:	1860-5974, 1860-5974
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!