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

Constraint solving on terms

Constraints in computational logics

ELAN from a rewriting logic point of view

Theoretical Computer Science - Rewriting logic and its applications

Decidability and Closure Properties of Equational Tree Languages

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

Beyond Regularity: Equational Tree Automata for Associative and Commutative Theories

CSL '01 Proceedings of the 15th International Workshop on Computer Science Logic

Promoting rewriting to a programming language: a compiler for non-deterministic rewrite programs in associative-commutative theories

Journal of Functional Programming

Multitree automata that count

Theoretical Computer Science - Foundations of software science and computation structures

Alternating two-way AC-tree automata

Information and Computation

Counting and equality constraints for multitree automata

FOSSACS'03/ETAPS'03 Proceedings of the 6th International conference on Foundations of Software Science and Computation Structures and joint European conference on Theory and practice of software