Journal Articles ACM Transactions on Computational Logic Year : 2013

Enumeration of monadic second-order queries on trees

Wojciech Kazana
  • Function : Author
  • PersonId : 948901
Luc Segoufin

Abstract

We consider the enumeration problem of monadic second-order (MSO) queries with first-order free variables over trees. Bagan showed ub 2006 that this problem is in CDlin. An enumeration problem belongs to CDlin 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.
Fichier principal
Vignette du fichier
enummso.pdf (188.79 Ko) Télécharger le fichier
Origin Files produced by the author(s)
Loading...

Dates and versions

hal-00916400 , version 1 (10-12-2013)

Identifiers

  • HAL Id : hal-00916400 , version 1

Cite

Wojciech Kazana, Luc Segoufin. Enumeration of monadic second-order queries on trees. ACM Transactions on Computational Logic, 2013, 14 (4). ⟨hal-00916400⟩
136 View
234 Download

Share

More