Balancing Straight-Line Programs for Strings and Trees
Pages 296 - 300
Abstract
The talk will explain a recent balancing result according to which a context-free grammar in Chomsky normal form of size m that produces a single string w of length n (such a grammar is also called a straight-line program) can be transformed in linear time into a context-free grammar in Chomsky normal form for w of size , whose unique derivation tree has depth . This solves an open problem in the area of grammar-based compression, improves many results in this area and greatly simplifies many existing constructions. Similar balancing results can be formulated for various grammar-based tree compression formalism like top DAGs and forest straight-line programs. The talk is based on joint work with Moses Ganardi and Artur Jeż. An extended abstract appeared in [11]; a long version of the paper can be found in [12].
References
[1]
Belazzougui D, Cording PH, Puglisi SJ, and Tabei Y Bansal N and Finocchi I Access, rank, and select in grammar-compressed strings Algorithms – ESA 2015 2015 Heidelberg Springer 142-154
[2]
Bille P, Cording PH, and Gørtz IL Compressed subsequence matching and packed tree coloring Algorithmica 2017 77 2 336-348
[3]
Bille P, Fernstrøm F, and Gørtz IL Fici G, Sciortino M, and Venturini R Tight bounds for top tree compression String Processing and Information Retrieval 2017 Cham Springer 97-102
[4]
Bille P, Gørtz IL, Cording PH, Sach B, Vildhøj HW, and Vind S Fingerprints in compressed strings J. Comput. Syst. Sci. 2017 86 171-180
[5]
Bille P, Gørtz IL, Landau GM, and Weimann O Tree compression with top trees Inf. Comput. 2015 243 166-177
[6]
Bille P, Landau GM, Raman R, Sadakane K, Satti SR, and Weimann O Random access to grammar-compressed strings and trees SIAM J. Comput. 2015 44 3 513-539
[7]
Busatto G, Lohrey M, and Maneth S Efficient memory representation of XML document trees Inf. Syst. 2008 33 4–5 456-474
[8]
Charikar M, Lehman E, Liu D, Panigrahy R, Prabhakaran M, Sahai A, and Shelat A The smallest grammar problem IEEE Trans. Inf. Theory 2005 51 7 2554-2576
[9]
Cole R and Vishkin U The accelerated centroid decomposition technique for optimal parallel tree evaluation in logarithmic time Algorithmica 1988 3 329-346
[10]
Dudek, B., Gawrychowski, P.: Slowing down top trees for better worst-case compression. In: Proceedings of the Annual Symposium on Combinatorial Pattern Matching, CPM 2018, volume 105 of LIPIcs, pp. 16:1–16:8. Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2018)
[11]
Ganardi, M., Jeż, A., Lohrey, M.: Balancing straight-line programs. In: Proceedings of the 60th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2019, pp. 1169–1183. IEEE Computer Society (2019)
[12]
Ganardi, M., Jeż, A., Lohrey, M.: Balancing straight-line programs. CoRR, abs/1902.03568 (2019)
[13]
Gascón A, Lohrey M, Maneth S, Reh CP, and Sieber K Fomin FV and Podolskii VV Grammar-based compression of unranked trees Computer Science – Theory and Applications 2018 Cham Springer 118-131
[14]
Gasieniec, L., Kolpakov, R.M., Potapov, I., Sant, P.: Real-time traversal in grammar-based compressed files. In: Proceedings of the 2005 Data Compression Conference, DCC 2005, p. 458. IEEE Computer Society (2005)
[15]
Gawrychowski, P., Jo, S., Mozes, S., Weimann, O.: Compressed range minimum queries. CoRR, abs/1902.04427 (2019)
[16]
Hübschle-Schneider L and Raman R Bampis E Tree compression with top trees revisited Experimental Algorithms 2015 Cham Springer 15-27
[17]
Tomohiro I et al. Detecting regularities on grammar-compressed strings Inf. Comput. 2015 240 74-89
[18]
Jeż A Approximation of grammar-based compression via recompression Theor. Comput. Sci. 2015 592 115-134
[19]
Jeż A A really simple approximation of smallest grammar Theor. Comput. Sci. 2016 616 141-150
[20]
Lohrey M Algorithmics on SLP-compressed strings: a survey Groups Complex. Cryptol. 2012 4 2 241-299
[21]
Lohrey M Potapov I Grammar-based tree compression Developments in Language Theory 2015 Cham Springer 46-57
[22]
Lohrey M, Maneth S, and Mennicke R XML tree structure compression using RePair Inf. Syst. 2013 38 8 1150-1167
[23]
Lohrey M, Maneth S, and Reh CP Constant-time tree traversal and subtree equality check for grammar-compressed trees Algorithmica 2018 80 7 2082-2105
[24]
Rytter W Application of Lempel-Ziv factorization to the approximation of grammar-based compression Theor. Comput. Sci. 2003 302 1–3 211-222
Index Terms
- Balancing Straight-Line Programs for Strings and Trees
Index terms have been assigned to the content through auto-classification.
Recommendations
Balancing Straight-line Programs
We show that a context-free grammar of size that produces a single string of length (such a grammar is also called a string straight-line program) can be transformed in linear time into a context-free grammar for of size , whose unique derivation tree ...
Learning trees from strings: a strong learning algorithm for some context-free grammars
Standard models of language learning are concerned with weak learning: the learner, receiving as input only information about the strings in the language, must learn to generalise and to generate the correct, potentially infinite, set of strings ...
Self-indexed Text Compression Using Straight-Line Programs
MFCS '09: Proceedings of the 34th International Symposium on Mathematical Foundations of Computer Science 2009Straight-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 ...
Comments
Information & Contributors
Information
Published In
Jun 2020
416 pages
ISBN:978-3-030-51465-5
DOI:10.1007/978-3-030-51466-2
© Springer Nature Switzerland AG 2020.
Publisher
Springer-Verlag
Berlin, Heidelberg
Publication History
Published: 29 June 2020
Qualifiers
- Article
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 0Total Downloads
- Downloads (Last 12 months)0
- Downloads (Last 6 weeks)0
Reflects downloads up to 07 Mar 2025