Polynomial operations on rational languages
4th Annual Symposium on Theoretical Aspects of Computer Sciences on STACS 87
Graph rewriting: an algebraic and logic approach
Handbook of theoretical computer science (vol. B)
Query evaluation via tree-decompositions
Journal of the ACM (JACM)
First-order queries on structures of bounded degree are computable with constant delay
ACM Transactions on Computational Logic (TOCL)
Linear delay enumeration and monadic second-order logic
Discrete Applied Mathematics
MSO queries on tree decomposable structures are computable with linear delay
CSL'06 Proceedings of the 20th international conference on Computer Science Logic
A combinatorial theorem for trees applications to monadic logic and infinite structures
ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming
| Hi-index | 0.00 |
We consider the enumeration problem of Monadic Second-Order (MSO) queries with first-order free variables over trees. In Bagan [2006] it was shown that this problem is in CONSTANT-DELAYlin. An enumeration problem belongs to CONSTANT-DELAYlin if for an input structure of size n it can be solved by: —an O(n) precomputation phase building an index structure, —followed by a phase enumerating the answers with no repetition and a constant delay between two consecutive outputs. In this article we give a different proof of this result based on the deterministic factorization forest decomposition theorem of Colcombet [2007].