Pages that link to "Item:Q261339"
From MaRDI portal
The following pages link to One-variable word equations in linear time (Q261339):
Displaying 9 items.
- Approximation of smallest linear tree grammar (Q342719) (← links)
- Word equations in the context of string solving (Q2163975) (← links)
- On the Solvability Problem for Restricted Classes of Word Equations (Q2817397) (← links)
- One-Unknown Word Equations and Three-Unknown Constant-Free Word Equations (Q2817399) (← links)
- On the Complexity of Solving Restricted Word Equations (Q4683237) (← links)
- One-Variable Word Equations and Three-Variable Constant-Free Word Equations (Q4683239) (← links)
- An Optimal Bound on the Solution Sets of One-Variable Word Equations and its Consequences (Q5002823) (← links)
- An Optimal Bound on the Solution Sets of One-Variable Word Equations and its Consequences (Q5026390) (← links)
- The hardness of solving simple word equations (Q5111232) (← links)
