The following pages link to (Q4219050):
Displaying 22 items.
- One-variable word equations in linear time (Q261339) (← links)
- Finding all solutions of equations in free groups and monoids with involution (Q342722) (← links)
- On word equations in one variable (Q547296) (← links)
- Compressed word problems in HNN-extensions and amalgamated products (Q639849) (← links)
- Equations in free semigroups with involution and their relation to equations in free groups. (Q1401304) (← links)
- On the complexity of the smallest grammar problem over fixed alphabets (Q2035481) (← links)
- Word equations in the context of string solving (Q2163975) (← links)
- Word equations in non-deterministic linear space (Q2237894) (← links)
- The complexity of compressed membership problems for finite automata (Q2254509) (← links)
- On PSPACE generation of a solution set of a word equation and its applications (Q2326385) (← links)
- The existential theory of equations with rational constraints in free groups is PSPACE-complete (Q2573633) (← links)
- More Than 1700 Years of Word Equations (Q2947143) (← links)
- Solutions to twisted word equations and equations in virtually free groups (Q3299596) (← links)
- Solution Sets for Equations over Free Groups are EDT0L Languages (Q3449471) (← links)
- On the Complexity of Hmelevskii’s Theorem and Satisfiability of Three Unknown Equations (Q3637246) (← links)
- (Q5092406) (← links)
- The hardness of solving simple word equations (Q5111232) (← links)
- Recognizing string graphs in NP (Q5917583) (← links)
- Tracing compressed curves in triangulated surfaces (Q5919981) (← links)
- Near-optimal quantum algorithms for string problems (Q6174814) (← links)
- On the structure of solution-sets to regular word equations (Q6614609) (← links)
- Internal pattern matching queries in a text and applications (Q6621750) (← links)
