Name
Abstract | ||
|---|---|---|
We start by considering binary words containing the minimum possible numbers of squares and antisquares (where an antisquare is a word of the form x (x) over bar), and we completely classify which possibilities can occur. We consider avoiding xp(x), where p is any permutation of the underlying alphabet, and xt(x), where t is any transformation of the underlying alphabet. Finally, we prove the existence of an infinite binary word simultaneously avoiding all occurrences of xh(x) for every nonerasing morphism h and all sufficiently large words x. |
Year | DOI | Venue |
|---|---|---|
2019 | 10.1007/978-3-030-28796-2_21 | COMBINATORICS ON WORDS, WORDS 2019 |
Field | DocType | Volume |
Discrete mathematics,Combinatorics,Of the form,Permutation,Overline,Morphism,Mathematics,Binary number,Alphabet | Journal | 11682 |
ISSN | Citations | PageRank |
0302-9743 | 0 | 0.34 |
References | Authors | |
0 | 4 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Tim Ng | 1 | 0 | 0.34 |
| Pascal Ochem | 2 | 258 | 36.91 |
| narad rampersad | 3 | 230 | 41.26 |
| Jeffrey Shallit | 4 | 198 | 39.00 |