Solving a unification problem under constrained substitutions using tree automata
type: Item
instance of: scholarly article
title: Solving a unification problem under constrained substitutions using tree automata
zbMATH Open document ID: 0878.68075
author: Yuichi Kaji
author: Toru Fujiwara
author: Tadao Kasami
published in: Journal of Symbolic Computation
publication date: 1997-05-28T00:00:00Z
Mathematics Subject Classification ID: 68Q42
zbMATH DE Number: 1014247
zbMATH Keywords: unification problem
zbMATH Keywords: constrained substitutions
MaRDI profile type: Publication
full work available at URL: jsco.1996.0077
OpenAlex ID: W2079422382
DOI: 10.1006/JSCO.1996.0077
Recommended article: Q4281553
Recommended article: Uniformization Problems for Tree-Automatic Relations and Top-Down Tree Transducers
Recommended article: On the Strength of Unambiguous Tree Automata
Recommended article: Q4994129
Recommended article: Automated Induction with Constrained Tree Automata
Recommended article: Automata-driven efficient subterm unification
Recommended article: Q4524790
Recommended article: Bottom-Up Tree Automata with Term Constraints
Recommended article: Q3126927
Recommended article: On nondeterministic unranked tree automata with sibling constraints
description: scientific article; zbMATH DE number 1014247