Solving a unification problem under constrained substitutions using tree automata

DOI10.1006/JSCO.1996.0077MaRDI QIDQ1355760zbMATH OpenOpenAlexFDO

Authors Yuichi Kaji, Toru Fujiwara, 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)

Recommendations

• scientific article; zbMATH DE number 512856
• Uniformization problems for tree-automatic relations and top-down tree transducers
• On the strength of unambiguous tree automata
• scientific article; zbMATH DE number 7360252
• Automated Induction with Constrained Tree Automata
• Automata-driven efficient subterm unification
• scientific article; zbMATH DE number 1552530
• Bottom-Up Tree Automata with Term Constraints
• scientific article; zbMATH DE number 996383
• On nondeterministic unranked tree automata with sibling constraints

Cited in

(2)

• Alternating two-way AC-tree automata
• Autosubst: Reasoning with de Bruijn Terms and Parallel Substitutions

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1355760)