A combinatorial problem on trapezoidal words.

DOI10.1016/S0304-3975(00)00431-XzbMath1050.68113MaRDI QIDQ1605325

Flavio D'Alessandro

Publication date: 15 July 2002

Published in: Theoretical Computer Science (Search for Journal in Brave)

zbMATH Keywords

Sturmian wordsSubword complexitySpecial factors

Mathematics Subject Classification ID

Combinatorics on words (68R15)

Related Items (6)

Closed, palindromic, rich, privileged, trapezoidal, and balanced words in automatic sequences ⋮ Generalized trapezoidal words ⋮ Rich, Sturmian, and trapezoidal words ⋮ Special factors and the combinatorics of suffix and factor automata ⋮ Rich and Periodic-Like Words ⋮ COMBINATORIAL PROPERTIES OF STURMIAN PALINDROMES

Cites Work

• Unnamed Item
• Unnamed Item
• Sur les facteurs des suites de Sturm. (On the factors of the Sturmian sequences.)
• On the combinatorics of finite words
• Sturmian words: structure, combinatorics, and their arithmetics
• Sturmian words, Lyndon words and trees
• Uniqueness Theorems for Periodic Functions

This page was built for publication: A combinatorial problem on trapezoidal words.