Solving a unification problem under constrained substitutions using tree automata

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

Typed functional query languages with equational specifications

Proceedings of the 14th ACM international conference on Information and knowledge management

Alternating two-way AC-tree automata

Information and Computation

Symbolic Reachability Analysis Using Narrowing and its Application to Verification of Cryptographic Protocols

Electronic Notes in Theoretical Computer Science (ENTCS)