Pages that link to "Item:Q2931409"
From MaRDI portal
The following pages link to An efficient algorithm for solving word equations (Q2931409):
Displaying 15 items.
- One-variable word equations in linear time (Q261339) (← links)
- Symbolic automata for representing big code (Q300407) (← links)
- 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)
- An SMT solver for regular expressions and linear arithmetic over string length (Q832270) (← links)
- Word equations in the context of string solving (Q2163975) (← links)
- Unification modulo lists with reverse relation with certain word equations (Q2305403) (← links)
- On the complexity of computation maximal exponent of periodicity of word equations and expressible relations (note) (Q2326386) (← links)
- Word-mappings of level 2 (Q2441544) (← links)
- On the Solvability Problem for Restricted Classes of Word Equations (Q2817397) (← links)
- Solution sets for equations over free groups are EDT0L languages (Q2821818) (← links)
- Chain-Free String Constraints (Q3297597) (← links)
- (Q5089281) (← links)
- The hardness of solving simple word equations (Q5111232) (← links)
- A solver for arrays with concatenation (Q6156632) (← links)
