The following pages link to (Q4146913):
Displaying 31 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)
- The hardness of solving simple word equations (Q5111232) (← links)
- The Diophantine problem in some metabelian groups (Q5113678) (← links)
- Equationally defined classes of semigroups (Q6145356) (← links)
- A decision procedure for string constraints with string/integer conversion and flat regular constraints (Q6150112) (← links)
- A solver for arrays with concatenation (Q6156632) (← links)
