We present a linear preprocessing and output-linear delay enumeration algorithm for MSO-queries over trees that are compressed in the well-established grammar-based framework. Time bounds are measured with respect to the size of the compressed representation of the tree. Our result extends previous work on the enumeration of MSO-queries over uncompressed trees and on the enumeration of document spanners over compressed text documents.

中文翻译：

---

压缩树上 MSO 查询的枚举

我们提出了一种线性预处理和输出线性延迟枚举算法，用于在树上进行 MSO 查询，这些树在完善的基于语法的框架中进行压缩。时间界限是根据树的压缩表示的大小来测量的。我们的结果扩展了之前关于未压缩树上的 MSO 查询枚举和压缩文本文档上的文档扳手枚举的工作。