The following pages link to (Q2955004):
Displaying 16 items.
- Blocksequences of \(k\)-local words (Q831795) (← links)
- Document spanners: from expressive power to decision problems (Q1650917) (← links)
- String factorisations with maximum or minimum dimension (Q2006777) (← links)
- Parameterized dictionary matching and recognition with one gap (Q2220853) (← links)
- Computing equality-free and repetitive string factorisations (Q2634669) (← links)
- Revisiting Shinohara's algorithm for computing descriptive patterns (Q2636407) (← links)
- On the Solvability Problem for Restricted Classes of Word Equations (Q2817397) (← links)
- Computing Equality-Free String Factorisations (Q3195710) (← links)
- The Maximum Equality-Free String Factorization Problem: Gaps vs. No Gaps (Q3297782) (← links)
- Diverse Palindromic Factorization Is NP-complete (Q3451091) (← links)
- Diverse Palindromic Factorization is NP-Complete (Q4640035) (← links)
- On the Complexity of Solving Restricted Word Equations (Q4683237) (← links)
- (Q5091271) (← links)
- The hardness of solving simple word equations (Q5111232) (← links)
- (Q5136316) (← links)
- Detecting One-Variable Patterns (Q5150937) (← links)
