Solving a unification problem under constrained substitutions using tree automata
From MaRDI portal
(Redirected from Solving a unification problem under constrained substitutions using tree automata)
Solving a unification problem under constrained substitutions using tree automata (scientific article; zbMATH DE number 2077127)
Solving a unification problem under constrained substitutions using tree automata (scientific article; zbMATH DE number 2077127)
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 Q4470511)