| dc.contributor.author | Currie, James D. | |
| dc.contributor.author | Saari, Kalle | |
| dc.date.accessioned | 2018-01-15T17:35:10Z | |
| dc.date.available | 2018-01-15T17:35:10Z | |
| dc.date.issued | 2014-01-12 | |
| dc.identifier.citation | Currie, James D., and Kalle Saari. "Square-free Words with Square-free Self-shuffles." Electronic Journal of Combinatorics 21(1) (2014): Paper #P1.9. | en_US |
| dc.identifier.issn | 1077-8926 | |
| dc.identifier.uri | http://hdl.handle.net/10680/1341 | |
| dc.description.abstract | We answer a question of Harju: For every n ≥ 3 there is a square-free ternary word of length n with a square-free self-shuffle. | en_US |
| dc.description.uri | http://www.combinatorics.org/ojs/index.php/eljc/article/view/v21i1p9 | |
| dc.language.iso | en | en_US |
| dc.publisher | The Electronic Journal of Combinatorics | en_US |
| dc.rights | info:eu-repo/semantics/openAccess | |
| dc.title | Square-free Words with Square-free Self-shuffles | en_US |
| dc.type | Article | en_US |
