On a Class of 2-Balanced Sequences

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

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

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

Cited In (5)

• 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
• 2-balanced sequences coding rectangle exchange transformation

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)