Pages that link to "Item:Q4923275"
From MaRDI portal
The following pages link to ALGORITHMIC COMBINATORICS ON PARTIAL WORDS (Q4923275):
Displaying 20 items.
- Several extensions of the Parikh matrix \(L\)-morphism (Q355509) (← links)
- Fast algorithm for partial covers in words (Q493243) (← links)
- Solutions to the multi-dimensional Prouhet-Tarry-Escott problem resulting from composition of balanced morphisms (Q515680) (← links)
- Square-free partial words (Q975472) (← links)
- Combinatorics on partial word correlations (Q986100) (← links)
- A generalization of Thue freeness for partial words (Q1006051) (← links)
- Overlap-freeness in infinite partial words (Q1006076) (← links)
- Testing avoidability on sets of partial words is hard (Q1006080) (← links)
- Efficient pattern matching in elastic-degenerate strings (Q2042726) (← links)
- Reduced word enumeration, complexity, and randomization (Q2144333) (← links)
- On the Language of Primitive Partial Words (Q2799195) (← links)
- (Q3442580) (← links)
- Relationally Periodic Sequences and Subword Complexity (Q3533010) (← links)
- (Q3687732) (← links)
- (Q3738586) (← links)
- (Q4529991) (← links)
- Characterizing Additive Systems (Q4575225) (← links)
- Algorithmics of Posets Generated by Words Over Partially Commutative Alphabets (Extended Version) (Q4621173) (← links)
- Fast Algorithm for Partial Covers in Words (Q4928571) (← links)
- Efficient Algorithms for Shortest Partial Seeds in Words (Q5165605) (← links)