On a Class of 2-Balanced Sequences

DOI10.1007/978-3-031-33180-0_11MaRDI QIDQ6134869

Martin Mašek, L'ubomíra Dvořáková, Edita Pelantová

Publication date: 25 July 2023

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

zbMATH Keywords

frequencybalancednessnumeration systemSturmian sequencefactor complexityabelian complexity

Mathematics Subject Classification ID

Combinatorics on words (68R15)

Related Items (1)

An upper bound on asymptotic repetition threshold of balanced sequences via colouring of the Fibonacci sequence

Cites Work

• Unnamed Item
• Unnamed Item
• Recurrent words with constant abelian complexity
• Balances for fixed points of primitive substitutions.
• Well-balanced sequences
• Almost everywhere balanced sequences of complexity \(2n + 1\)
• BALANCE PROPERTIES OF ARNOUX–RAUZY WORDS
• Abelian complexity of minimal subshifts
• On theβ-expansions of real numbers
• The Rauzy Gasket
• Sequences with minimal block growth
• Symbolic Dynamics II. Sturmian Trajectories
• Abelian combinatorics on words: a survey
• Generalizations of Sturmian sequences associated with \(\boldsymbol{N}\)-continued fraction algorithms

This page was built for publication: On a Class of 2-Balanced Sequences