116
click to vote
FSTTCS
2008
Springer
15 years 3 months ago
2008
Springer
Tight connections between leafs languages and strings compressed via straight-line programs (SLPs) are established. It is shown that the compressed membership problem for a languag...