| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 420955 | Discrete Applied Mathematics | 2007 | 5 Pages |
Abstract
A word is called fair if it contains, for each pair of distinct symbols a,ba,b, the same number of occurrences of the scattered subword ab as of ba . We prove that if the first k+1k+1 words in the sequence generated by a D0LD0L system over a k-letter alphabet are fair then all words in the sequence are fair.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Anton Černý,