Sciweavers

Share
CSL
2001
Springer

Beyond Regularity: Equational Tree Automata for Associative and Commutative Theories

11 years 6 months ago
Beyond Regularity: Equational Tree Automata for Associative and Commutative Theories
Abstract. A new tree automata framework, called equational tree automata, is presented. In the newly introduced setting, congruence closures of recognizable tree languages are recognizable. Furthermore, we prove that in certain useful cases, recognizable tree languages are closed under union and intersection. To compare with early related work, e.g. [7], we discuss the relationship between linear bounded automata and equational tree automata. As a consequence, we obtain some (un)decidability results. We further present a hierarchy of 4 classes of tree languages. Keywords. Tree automata, equational theory, decidability
Hitoshi Ohsaki
Added 28 Jul 2010
Updated 28 Jul 2010
Type Conference
Year 2001
Where CSL
Authors Hitoshi Ohsaki
Comments (0)
books