Fully bordered words
Formal Languages and Automata Theory
2019-12-18 v2 Combinatorics
Abstract
We characterize binary words that have exactly two unbordered conjugates and show that they can be expressed as a product of two palindromes.
Cite
@article{arxiv.1504.02222,
title = {Fully bordered words},
author = {Štěpán Holub and Mike Müller},
journal= {arXiv preprint arXiv:1504.02222},
year = {2019}
}
Comments
A significantly expanded version