Pages that link to "Item:Q5919279"
From MaRDI portal
The following pages link to Efficient representation and counting of antipower factors in words (Q5919279):
Displaying 10 items.
- Word representations of \(m\times n\times p\) proper arrays (Q1024426) (← links)
- Algorithms for anti-powers in strings (Q1641162) (← links)
- New bounds on antipowers in words (Q2203608) (← links)
- On anti-powers in aperiodic recurrent words (Q2221772) (← links)
- Special issue: Selected papers of the 13th international conference on language and automata theory and applications, LATA 2019 (Q2672651) (← links)
- Computing the Antiperiod(s) of a String (Q5088925) (← links)
- Circular pattern matching with \(k\) mismatches (Q5918999) (← links)
- Efficient representation and counting of antipower factors in words (Q5919279) (← links)
- (Q5925560) (redirect page) (← links)
- Online algorithms on antipowers and antiperiods (Q6536254) (← links)