Word unification and transformation of generalized equations
From MaRDI portal
Publication:1319389
DOI10.1007/BF00881904zbMath0802.68136OpenAlexW2069915937MaRDI QIDQ1319389
Publication date: 11 December 1994
Published in: Journal of Automated Reasoning (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf00881904
free semigroupsword equationsunification theoryassociative unificationMakanin's algorithmstring-unification
Free semigroups, generators and relations, word problems (20M05) Mechanization of proofs and logical operations (03B35) Semigroups in automata theory, linguistics, etc. (20M35)
Related Items (16)
An algorithm for distributive unification ⋮ The word matching problem is undecidable for finite special string-rewriting systems that are confluent ⋮ Makanin's algorithm is not primitive recursive ⋮ Equations in free semigroups with involution and their relation to equations in free groups. ⋮ Decidability of bounded higher-order unification ⋮ Solving equations with sequence variables and sequence functions ⋮ What Is Essential Unification? ⋮ Solvability of word equations modulo finite special and confluent string-rewriting systems is undecidable in general ⋮ Graph unification and matching ⋮ Unnamed Item ⋮ Flat matching ⋮ On equality up-to constraints over finite trees, context unification, and one-step rewriting ⋮ Pattern Unification with Sequence Variables and Flexible Arity Symbols ⋮ The hardness of solving simple word equations ⋮ Solvability of context equations with two context variables is decidable ⋮ \(\forall \exists^{5}\)-equational theory of context unification is undecidable
Cites Work
This page was built for publication: Word unification and transformation of generalized equations
