RePair in Compressed Space and Time

Kensuke Sakai, Tatsuya Ohno, Keisuke Goto +3

Given a string $T$ of length $N$, the goal of grammar compression is to construct a small context-free grammar generating only $T$. Among existing grammar compression methods, RePa…