Open and closed factors in Arnoux-Rauzy words

DOI10.1016/j.aam.2019.02.007OpenAlexW2963165201WikidataQ128316567 ScholiaQ128316567MaRDI QIDQ2423399

Luca Q. Zamboni, Olga G. Parshina

Publication date: 21 June 2019

Published in: Advances in Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1810.05472

zbMATH Keywords

complexitySturmian wordArnoux-Rauzy wordreturn wordfirst returnclosed word

Mathematics Subject Classification ID

Combinatorics on words (68R15)

Related Items (2)

Finite and infinite closed-rich words ⋮ On closed-rich words

Cites Work

• Unnamed Item
• Introducing privileged words: privileged complexity of Sturmian words
• Cyclic complexity of words
• Palindromic richness
• Sturmian words: structure, combinatorics, and their arithmetics
• Fine and Wilf words for any periods
• Episturmian words and episturmian morphisms
• Palindrome complexity.
• Enumeration and structure of trapezoidal words
• Closed, palindromic, rich, privileged, trapezoidal, and balanced words in automatic sequences
• Abelian complexity of minimal subshifts
• Sturmian and Episturmian Words
• Représentation géométrique de suites de complexité $2n+1$
• Sequence entropy and the maximal pattern complexity of infinite words
• On a group theoretic generalization of the Morse-Hedlund theorem
• Sequences with minimal block growth
• Episturmian words and some constructions of de Luca and Rauzy
• Periodic-like words, periodicity, and boxes

This page was built for publication: Open and closed factors in Arnoux-Rauzy words