Approximation of Grammar-Based Compression via Recompression

DOI10.1007/978-3-642-38905-4_17zbMath1381.68316arXiv1301.5842OpenAlexW2189745519MaRDI QIDQ4928570

Artur Jeż

Publication date: 14 June 2013

Published in: Combinatorial Pattern Matching (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1301.5842

zbMATH Keywords

grammar-based compressionSLPconstruction of the smallest grammar

Mathematics Subject Classification ID

Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Grammars and rewriting systems (68Q42) Approximation algorithms (68W25) Algorithms on strings (68W32)

Related Items (5)

Grammar-Based Tree Compression ⋮ Approximation of grammar-based compression via recompression ⋮ Staged self-assembly and polyomino context-free grammars ⋮ Compressibility of Finite Languages by Grammars ⋮ One-variable word equations in linear time

This page was built for publication: Approximation of Grammar-Based Compression via Recompression