Pages that link to "Item:Q6169560"
From MaRDI portal
The following pages link to Makanin's algorithm for word equations-two improvements and a generalization (Q6169560):
Displaying 31 items.
- Finding all solutions of equations in free groups and monoids with involution (Q342722) (← links)
- Z3str2: an efficient solver for strings, regular expressions, and length constraints (Q526767) (← links)
- Solvability of word equations modulo finite special and confluent string-rewriting systems is undecidable in general (Q673984) (← links)
- Regular expression order-sorted unification and matching (Q741252) (← links)
- An SMT solver for regular expressions and linear arithmetic over string length (Q832270) (← links)
- On the relation between context and sequence unification (Q1034550) (← links)
- Equational unification, word unification, and 2nd-order equational unification (Q1129255) (← links)
- Word unification and transformation of generalized equations (Q1319389) (← links)
- Equations in words: An algorithmic contribution (Q1326954) (← links)
- Non-structural subtype entailment in automata theory (Q1887157) (← links)
- Solving word equations modulo partial commutations (Q1960424) (← links)
- Word equations in the context of string solving (Q2163975) (← 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)
- Decidability of bounded higher-order unification (Q2456577) (← links)
- The existential theory of equations with rational constraints in free groups is PSPACE-complete (Q2573633) (← links)
- Asymptotic invariants, complexity of groups and related problems (Q3143713) (← links)
- Chain-Free String Constraints (Q3297597) (← links)
- What Is Essential Unification? (Q3305325) (← links)
- On word equations and Makanin's algorithm (Q3974850) (← links)
- Complexity of Makanin's algorithm (Q4371685) (← links)
- Solving trace equations using lexicographical normal forms (Q4571965) (← links)
- The word matching problem is undecidable for finite special string-rewriting systems that are confluent (Q4571993) (← links)
- Some independence results for equational unification (Q5055843) (← links)
- Linear second-order unification (Q5055871) (← links)
- Advances in Artificial Intelligence – SBIA 2004 (Q5311246) (← links)
- Solving word equations (Q5899816) (← links)
- Implementation of Makanin's Algorithm (Q6114506) (← links)
- Decision procedures for sequence theories (Q6535526) (← links)
- A closer look at the expressive power of logics based on word equations (Q6580075) (← links)
- On the structure of solution-sets to regular word equations (Q6614609) (← links)
