On a Class of 2-Balanced Sequences

DOI10.1007/978-3-031-33180-0_11MaRDI QIDQ6134869zbMATH OpenFDO

Authors L'ubomíra Dvořáková, Martin Mašek, 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)

Cites work

• scientific article; zbMATH DE number 1737190 (Why is no real title available?)
• Abelian combinatorics on words: a survey
• Abelian complexity of minimal subshifts
• Almost everywhere balanced sequences of complexity \(2n + 1\)
• Balance properties of Arnoux-Rauzy words
• Balances for fixed points of primitive substitutions.
• Generalizations of Sturmian sequences associated with \(\boldsymbol{N}\)-continued fraction algorithms
• On theβ-expansions of real numbers
• Recurrent words with constant abelian complexity
• Sequences with minimal block growth
• Symbolic Dynamics II. Sturmian Trajectories
• The Rauzy gasket
• Ultimately constant abelian complexity of infinite words
• Well-balanced sequences

Cited in

(5)

• 2-balanced sequences coding rectangle exchange transformation
• Balanced 2-subsets
• A characterization of balanced episturmian sequences
• An upper bound on asymptotic repetition threshold of balanced sequences via colouring of the Fibonacci sequence
• A class of self-orthogonal 2-sequencings

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6134869)