Algorithmics on SLP-compressed strings: A survey

Markus Lohrey
2012 Groups - Complexity - Cryptology  
Results on algorithmic problems on strings that are given in a compressed form via straightline programs are surveyed. A straight-line program is a context-free grammar that generates exactly one string. In this way, exponential compression rates can be achieved. Among others, we study pattern matching for compressed strings, membership problems for compressed strings in various kinds of formal languages, and the problem of querying compressed strings. Applications in combinatorial group theory
more » ... and computational topology and to the solution of word equations are discussed as well. Finally, extensions to compressed trees and pictures are considered.
doi:10.1515/gcc-2012-0016 fatcat:o7lrrx3cgvhqrhmf4bsulc7rsa