A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
Self-indexed Text Compression Using Straight-Line Programs
[chapter]
2009
Lecture Notes in Computer Science
Straight-line programs (SLPs) offer powerful text compression by representing a text T [1, u] in terms of a restricted context-free grammar of n rules, so that T can be recovered in O(u) time. However, the problem of operating the grammar in compressed form has not been studied much. We present a grammar representation whose size is of the same order of that of a plain SLP representation, and can answer other queries apart from expanding nonterminals. This can be of independent interest. We
doi:10.1007/978-3-642-03816-7_21
fatcat:ffoakvtmlvbqjdbwlpl7c5stai