Document Open Access Logo

Leaf languages and string compression

Author Markus Lohrey

PDF

File

Thumbnail PDF
PDF
LIPIcs.FSTTCS.2008.1761.pdf
  • Filesize: 432 kB
  • 12 pages

Document Identifiers

Subject Classification

Keywords
  • Leaf languages
  • string compression
  • grammar-based compression
  • complexity theory

Metrics

  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    0
    PDF Downloads
    0
    Metadata Views

Abstract

Tight connections between leafs languages and strings compressed
via straight-line programs (SLPs) are established. It is shown 
that the compressed membership problem for a language $L$ is complete
for the leaf language class defined by $L$ via logspace machines.
A more difficult variant of the compressed membership problem for
$L$ is shown to be complete for the leaf language class defined 
by $L$ via polynomial time machines. As a corollary,
a fixed linear visibly pushdown language with 
a PSPACE-complete compressed membership problem is obtained. 
For XML languages,
the compressed membership problem is shown to be coNP-complete.

Cite As Get BibTex

Markus Lohrey. Leaf languages and string compression. In IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science. Leibniz International Proceedings in Informatics (LIPIcs), Volume 2, pp. 292-303, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2008) https://doi.org/10.4230/LIPIcs.FSTTCS.2008.1761

Author Details

Markus Lohrey
Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail
© 2023-2025 Schloss Dagstuhl – LZI GmbH About DROPS Imprint Privacy Contact