Abstract
We study the compressed representation of a ranked tree by a (string) straight-line program (SLP) for its preorder traversal, and compare it with the well-studied representation by straight-line co...
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have