Counting in Trees for Free
Lecture Notes in Computer Science(2004)
摘要
it is known that MSO logic for ordered unranked trees is undecidable if Presburger constraints are allowed at children of nodes. We show here that a decidable logic is obtained if we use a modal fixpoint logic instead. We present a characterization of this logic by means of deterministic Presburger tree automata and show how it can be used to express numerical document queries. Surprisingly, the complexity of satisfiability for the extended logic is asymptotically the same as for the original fixpoint logic. The non-emptiness for Presburger tree automata (PTA) is PSPACE-complete, which is moderate given that it is already PSPACE-hard to test whether the complement of a regular expression is non-empty. We also identify a subclass of PTAs with a tractable non-emptiness problem. Further, to decide whether a tree t satisfies a formula phi is polynomial in the size of phi and linear in the size of t. A technical construction of independent interest is a linear time construction of a Presburger formula for the Parikh image of a regular language.
更多查看译文
关键词
linear time,regular expression,deterministic automaton,numerical method,programming language,decidability,satisfiability,modal logic,monadic logic,regular language
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要