Beyond Regularity: Equational Tree Automata for Associative and Commutative Theories

Authors:
Hitoshi Ohsaki
Affiliations:
-
Venue:
CSL '01 Proceedings of the 15th International Workshop on Computer Science Logic
Year:
2001

Citing 9
Cited 10

String-rewriting systems

String-rewriting systems
Tree automata help one to solve equational formulae in AC-theories

Journal of Symbolic Computation
Solving a unification problem under constrained substitutions using tree automata

Journal of Symbolic Computation
Regular expression types for XML

ICFP '00 Proceedings of the fifth ACM SIGPLAN international conference on Functional programming
Introduction To Automata Theory, Languages, And Computation

Introduction To Automata Theory, Languages, And Computation
The Reachability Problem for Ground TRS and Some Extensions

TAPSOFT '89/CAAP '89 Proceedings of the International Joint Conference on Theory and Practice of Software Development, Volume 1: Advanced Seminar on Foundations of Innovative Software Development I and Colloquium on Trees in Algebra and Programming
Decidable Call by Need Computations in term Rewriting (Extended Abstract)

CADE-14 Proceedings of the 14th International Conference on Automated Deduction
Abstracting Cryptographic Protocols with Tree Automata

SAS '99 Proceedings of the 6th International Symposium on Static Analysis
Regular Tree Languages And Rewrite Systems

Fundamenta Informaticae

Decidability and Closure Properties of Equational Tree Languages

RTA '02 Proceedings of the 13th International Conference on Rewriting Techniques and Applications
Languages Modulo Normalization

FroCoS '07 Proceedings of the 6th international symposium on Frontiers of Combining Systems
Combining Equational Tree Automata over AC and ACI Theories

RTA '08 Proceedings of the 19th international conference on Rewriting Techniques and Applications
Closure of Hedge-Automata Languages by Hedge Rewriting

RTA '08 Proceedings of the 19th international conference on Rewriting Techniques and Applications
Tree Automata for Non-linear Arithmetic

RTA '08 Proceedings of the 19th international conference on Rewriting Techniques and Applications
Monotone AC-Tree automata

LPAR'05 Proceedings of the 12th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
A sufficient completeness checker for linear order-sorted specifications modulo axioms

IJCAR'06 Proceedings of the Third international joint conference on Automated Reasoning
Automata and logics for unranked and unordered trees

RTA'05 Proceedings of the 16th international conference on Term Rewriting and Applications
Alternation in equational tree automata modulo XOR

FSTTCS'04 Proceedings of the 24th international conference on Foundations of Software Technology and Theoretical Computer Science
Propositional tree automata

RTA'06 Proceedings of the 17th international conference on Term Rewriting and Applications

Quantified Score

Hi-index	0.00

Visualization

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.