License
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.CPM.2017.2
URN: urn:nbn:de:0030-drops-73475
URL: http://drops.dagstuhl.de/opus/volltexte/2017/7347/
Go to the corresponding LIPIcs Volume Portal


Jez, Artur

Recompression of SLPs

pdf-format:
LIPIcs-CPM-2017-2.pdf (0.2 MB)


Abstract

In this talk I will survey the recompression technique in case of SLPs. The technique is based on applying simple compression operations (replacement of pairs of two different letters by a new letter and replacement of maximal repetition of a letter by a new symbol) to strings represented by SLPs. To this end we modify the SLPs, so that performing such compression operations on SLPs is possible. For instance, when we want to replace ab in the string and SLP has a production X to aY and the string generated by Y is bw, then we alter the rule of Y so that it generates w and replace Y with bY in all rules. In this way the rule becomes X to abY and so ab can be replaced, similar operations are defined for the right sides of the nonterminals. As a result, we are interested mostly in the SLP representation rather than the string itself and its combinatorial properties. What we need to control, though, is the size of the SLP. With appropriate choices of substrings to be compressed it can be shown that it stays linear. The proposed method turned out to be surprisingly efficient and applicable in various scenarios: for instance it can be used to test the equality of SLPs in time O(n log N), where n is the size of the SLP and N the length of the generated string; on the other hand it can be used to approximate the smallest SLP for a given string, with the approximation ratio O(log(n/g)) where n is the length of the string and g the size of the smallest SLP for this string, matching the best known bounds.

BibTeX - Entry

@InProceedings{jez:LIPIcs:2017:7347,
  author =	{Artur Jez},
  title =	{{Recompression of SLPs}},
  booktitle =	{28th Annual Symposium on Combinatorial Pattern Matching (CPM 2017)},
  pages =	{2:1--2:1},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-039-2},
  ISSN =	{1868-8969},
  year =	{2017},
  volume =	{78},
  editor =	{Juha K{\"a}rkk{\"a}inen and Jakub Radoszewski and Wojciech Rytter},
  publisher =	{Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{http://drops.dagstuhl.de/opus/volltexte/2017/7347},
  URN =		{urn:nbn:de:0030-drops-73475},
  doi =		{10.4230/LIPIcs.CPM.2017.2},
  annote =	{Keywords: Straight Line Programs, smallest grammar problem, compression, pro- cessing compressed data, recompression}
}

Keywords: Straight Line Programs, smallest grammar problem, compression, pro- cessing compressed data, recompression
Seminar: 28th Annual Symposium on Combinatorial Pattern Matching (CPM 2017)
Issue Date: 2017
Date of publication: 28.06.2017


DROPS-Home | Fulltext Search | Imprint Published by LZI