# Item

ITEM ACTIONSEXPORT

Released

Conference Paper

#### Approximation of Grammar-based Compression via Recompression

##### Locator

There are no locators available

##### Fulltext (public)

There are no public fulltexts available

##### Supplementary Material (public)

There is no public supplementary material available

##### Citation

Jeż, A. (2013). Approximation of Grammar-based Compression via Recompression. In J.
Fischer, & P. Sanders (*Combinatorial Pattern Matching*
(pp. 165-176). Berlin: Springer. doi:10.1007/978-3-642-38905-4_17.

Cite as: http://hdl.handle.net/11858/00-001M-0000-0015-3F30-C

##### Abstract

We present a simple linear-time algorithm constructing a~context-free grammar
of size O(g \log (N/g))
for the input string of size N, where
g the size of the optimal grammar generating this string.
The algorithm works for arbitrary size alphabets,
but the running time is linear assuming that the alphabet Σ of the input
string
is a subset of 1,\ldots , N^c for some constant c.
Algorithms with such an approximation guarantees and running time are known,
the novelty of this paper is the particular simplicity of the algorithm
as well as the analysis of the algorithm, which uses a general
technique of recompression recently introduced by the author.
Furthermore, contrary to the previous results, this work does not use the LZ
representation
of the input string in the construction, nor in the analysis.