Choosing Word Occurrences for the Smallest Grammar Problem

@inproceedings{Carrascosa2010ChoosingWO,
  title={Choosing Word Occurrences for the Smallest Grammar Problem},
  author={Rafael Carrascosa and François Coste and Matthias Gall{\'e} and Gabriel G. Infante L{\'o}pez},
  booktitle={LATA},
  year={2010}
}
The smallest grammar problem namely, finding a smallest context-free grammar that generates exactly one sequence is of practical and theoretical importance in fields such as Kolmogorov complexity, data compression and pattern discovery. We propose to focus on the choice of the occurrences to be rewritten by non-terminals. We extend classical offline algorithms by introducing a global optimization of this choice at each step of the algorithm. This approach allows us to define the search space of… CONTINUE READING