The following pages link to (Q4146913):
Displaying 50 items.
- One-variable word equations in linear time (Q261339) (← links)
- Finding all solutions of equations in free groups and monoids with involution (Q342722) (← links)
- An efficient SMT solver for string constraints (Q518402) (← links)
- On word equations in one variable (Q547296) (← links)
- On the complexity of decidable cases of the commutation problem of languages (Q557812) (← links)
- On systems of equations over free products of groups. (Q651246) (← links)
- Systems of equations over a free monoid and Ehrenfeucht's conjecture (Q786545) (← links)
- An SMT solver for regular expressions and linear arithmetic over string length (Q832270) (← links)
- On equations in free semigroups with certain constraints on their solutions. (Q843606) (← links)
- The lengths of proofs: Kreisel's conjecture and Gödel's speed-up theorem (Q843609) (← links)
- Generalizing proofs in monadic languages (with a postscript by Georg Kreisel). (Q930260) (← links)
- Equations in free topoboolean algebra (Q1092029) (← links)
- Unification problem in equational theories (Q1280985) (← links)
- Positive theories of free monoids (Q1320694) (← links)
- Equations in free semigroups with involution and their relation to equations in free groups. (Q1401304) (← links)
- Decidability and complexity of simultaneous rigid E-unification with one variable and related results (Q1575636) (← links)
- Undecidability of a simple fragment of a positive theory with a single constant for a free semigroup of rank two (Q1582961) (← links)
- On positive and critical theories of some classes of rings (Q1587004) (← links)
- Systems of word equations, polynomials and linear algebra: a new approach (Q1631611) (← links)
- On the deficit of a finite set of words (Q1822632) (← links)
- Checking sets, test sets, rich languages and commutatively closed languages (Q1837540) (← links)
- Logic with equality: Partisan corroboration and shifted pairing (Q1854299) (← links)
- Undecidability of the positive \(\forall\exists^ 3\)-theory of a free semigroup (Q1921846) (← links)
- Solving word equations modulo partial commutations (Q1960424) (← links)
- Monadic simultaneous rigid \(E\)-unification (Q1960540) (← links)
- A decision procedure for string to code point conversion (Q2096448) (← links)
- Word equations in the context of string solving (Q2163975) (← links)
- Word equations in non-deterministic linear space (Q2237894) (← links)
- On systems of word equations over three unknowns with at most six occurrences of one of the unknowns (Q2271428) (← links)
- Equations over free inverse monoids with idempotent variables (Q2411041) (← links)
- Decision procedures for term algebras with integer constraints (Q2432767) (← links)
- Word-mappings of level 2 (Q2441544) (← links)
- On maximal chains of systems of word equations (Q2510762) (← links)
- The existential theory of equations with rational constraints in free groups is PSPACE-complete (Q2573633) (← links)
- EDT0L solutions to equations in group extensions (Q2682843) (← links)
- On the Solvability Problem for Restricted Classes of Word Equations (Q2817397) (← links)
- More Than 1700 Years of Word Equations (Q2947143) (← links)
- A Decision Procedure for Regular Membership and Length Constraints over Unbounded Strings (Q2964458) (← links)
- On systems of equations over free partially commutative groups (Q3091752) (← links)
- Identity Problems, Solvability of Equations and Unification in Varieties of Semigroups Related to Varieties of Groups (Q3098040) (← links)
- Solutions to twisted word equations and equations in virtually free groups (Q3299596) (← links)
- An Analysis and a Reproof of Hmelevskii’s Theorem (Q3533033) (← links)
- Definability in the Infix Order on Words (Q3637247) (← links)
- Equations in groups (Q3913587) (← links)
- Finite degrees of ambiguity in pattern languages (Q4365010) (← links)
- On the studies of Gennadii Semënovich Makanin on algorithmic questions of the theory of groups and semigroups (Q4558123) (← links)
- Monadic simultaneous rigid E-unification and related problems (Q4571948) (← 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)
- Equations in Algebras (Q4611337) (← links)
