Enumeration and structure of trapezoidal words
From MaRDI portal
Publication:1935783
DOI10.1016/j.tcs.2012.11.007zbMath1258.68106arXiv1203.1203OpenAlexW2033538132MaRDI QIDQ1935783
Michelangelo Bucci, Alessandro De Luca, Gabriele Fici
Publication date: 19 February 2013
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1203.1203
Related Items
The sequence of open and closed prefixes of a Sturmian word ⋮ Initial non-repetitive complexity of infinite words ⋮ Closed Ziv-Lempel factorization of the \(m\)-bonacci words ⋮ Closed, palindromic, rich, privileged, trapezoidal, and balanced words in automatic sequences ⋮ On the structure of bispecial Sturmian words ⋮ Open and closed factors in Arnoux-Rauzy words ⋮ Maximal closed substrings ⋮ Generalized trapezoidal words
