Solving a unification problem under constrained substitutions using tree automata

DOI10.1006/JSCO.1996.0077zbMath0878.68075OpenAlexW2079422382MaRDI QIDQ1355760

Toru Fujiwara, Yuichi Kaji, Tadao Kasami

Publication date: 28 May 1997

Published in: Journal of Symbolic Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jsco.1996.0077

zbMATH Keywords

unification problemconstrained substitutions

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

Related Items (1)

Alternating two-way AC-tree automata

This page was built for publication: Solving a unification problem under constrained substitutions using tree automata