Pages that link to "Item:Q3474892"

The following pages link to Minimal and complete word unification (Q3474892):

Displaying 27 items.

• Generating languages by a derivation procedure for elementary formal systems (Q294648) (← links)
• Solvability of word equations modulo finite special and confluent string-rewriting systems is undecidable in general (Q673984) (← links)
• Flat matching (Q999086) (← links)
• On the relation between context and sequence unification (Q1034550) (← links)
• Makanin's algorithm is not primitive recursive (Q1127320) (← links)
• Unification problem in equational theories (Q1280985) (← links)
• Word unification and transformation of generalized equations (Q1319389) (← links)
• Unification in partially commutative semigroups (Q1337561) (← links)
• Equations in free semigroups with involution and their relation to equations in free groups. (Q1401304) (← links)
• Solvability of context equations with two context variables is decidable (Q1599536) (← links)
• \(\forall \exists^{5}\)-equational theory of context unification is undecidable (Q1607219) (← links)
• Word equations in non-deterministic linear space (Q2237894) (← links)
• On PSPACE generation of a solution set of a word equation and its applications (Q2326385) (← links)
• Solving equations with sequence variables and sequence functions (Q2457427) (← links)
• What Is Essential Unification? (Q3305325) (← links)
• System Description: E.T. 0.1 (Q3454109) (← links)
• Regular Patterns in Second-Order Unification (Q3454122) (← links)
• Towards parametrizing word equations (Q4331050) (← links)
• The word matching problem is undecidable for finite special string-rewriting systems that are confluent (Q4571993) (← links)
• Graph unification and matching (Q4645268) (← links)
• An algorithm for distributive unification (Q5055867) (← links)
• (Q5092406) (← links)
• The hardness of solving simple word equations (Q5111232) (← links)
• Proving convergence of self-stabilizing systems using first-order rewriting and regular languages (Q5138353) (← links)
• On equality up-to constraints over finite trees, context unification, and one-step rewriting (Q5234685) (← links)
• Solving word equations (Q5916475) (← links)
• Codes and equations on trees (Q5941083) (← links)