Results on algorithmic problems on strings that are given in a compressed form via straight-
line programs are surveyed. A straight-line program is a context-free grammar that …

We consider several basic problems for texts and show that if the input texts are given by
their Lempel-Ziv codes then the problems can be solved deterministically in polynomial time …

In this article, a fully compressed pattern matching problem is studied. The compression is
represented by straight-line programs (SLPs)—that is, context-free grammars generating …

What kind of operations can we perform effectively (without full unpacking) with compressed
texts? In this paper we consider three fundamental problems:(1) check the equality of two …

We show an efficient pattern-matching algorithm for strings that are succinctly described in
terms of straight-line programs, in which the constants are symbols and the only operation is …

We investigate the time complexity of the pattern matching problem for strings which are
succinctly described in terms of straight-line programs, in which the constants are symbols …

The study of computational problems in combinatorial group theory goes back more than
100 years. In a seminal paper from 1911, Max Dehn posed three decision problems [46]: the …

We find polynomial-time solutions to the word problem for free-by-cyclic groups, the word
problem for automorphism groups of free groups, and the membership problem for the …

We survey several complexity issues related to algorithmic problems on words given in an
implicit way: by a grammar, LZ-encoding or as a minimal solution of a word equation. We …

The most fundamental problem considered in algorithms for text processing is pattern
matching: given a pattern p of length m and a text t of length n, does p occur in t? Multiple …