| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 438924 | Theoretical Computer Science | 2012 | 11 Pages |
Abstract
Combinatorial properties of maximal repetitions (runs) in formal words are studied. We classify all maximal repetitions in a word as primary and secondary where the set of all primary repetitions determines all the other repetitions in the word. Essential combinatorial properties of primary repetitions are established.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
