| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 437062 | Theoretical Computer Science | 2006 | 8 Pages |
Abstract
We obtain new results on minimum lengths of words in an unavoidable set of words of cardinality n before introducing the notion of aperiodic unavoidable sets, a natural extension of unavoidable sets.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
