Enumeration of Monadic Second-Order Queries on Trees

被引：17
|
作者：
Kazana, Wojciech [1 ,2 ]
Segoufin, Luc [1 ,2 ]
机构：
[1] INRIA, Paris, France
[2] ENS Cachan, Cachan, France
来源：
ACM TRANSACTIONS ON COMPUTATIONAL LOGIC | 2013年 / 14卷 / 04期
基金：
欧洲研究理事会;
关键词：
Algorithms; Monadic second-order; bounded tree-width; enumeration; logic;
D O I：
10.1145/2528928
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
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-DELAY(lin). An enumeration problem belongs to CONSTANT-DELAY(lin) 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].
引用
收藏
页数：12
相关论文
共 50 条
12345