| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 439120 | Theoretical Computer Science | 2009 | 7 Pages |
Abstract
We show that every avoidable pattern can be avoided by an infinite sequence of palindromes over a fixed finite alphabet.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
