The following pages link to Counting distinct strings (Q1277320):
Displaying 18 items.
- Inferring strings from suffix trees and links on a binary alphabet (Q496548) (← links)
- Verifying and enumerating parameterized border arrays (Q650937) (← links)
- Counting certain binary strings (Q665047) (← links)
- Border correlation of binary words (Q703695) (← links)
- Combinatorics on partial word borders (Q897922) (← links)
- Counting suffix arrays and strings (Q932319) (← links)
- Validating the Knuth-Morris-Pratt failure function, fast and online (Q1678758) (← links)
- Inferring an indeterminate string from a prefix graph (Q2343296) (← links)
- New bounds and extended relations between prefix arrays, border arrays, undirected graphs, and indeterminate strings (Q2363963) (← links)
- Inferring strings from Lyndon factorization (Q2402270) (← links)
- On Maximal Unbordered Factors (Q2942272) (← links)
- Representing prefix and border tables: results on enumeration (Q2971066) (← links)
- Counting Colours in Compressed Strings (Q3011854) (← links)
- Counting Parameterized Border Arrays for a Binary Alphabet (Q3618600) (← links)
- Efficient validation and construction of border arrays and validation of string matching automata (Q3625694) (← links)
- (Q3740259) (← links)
- Another way to count characters (Q4243152) (← links)
- Counting Dependent and Independent Strings (Q5415292) (← links)