Languages under substitutions and balanced words

DOI10.5802/JTNB.438MaRDI QIDQ558187zbMATH OpenOpenAlexFDO

Authors Alex Heinis

Publication date 30 June 2005

Published in Journal de Théorie des Nombres de Bordeaux (Search for Journal in Brave)

Full work available at URL http://www.numdam.org/item?id=JTNB_2004__16_1_151_0, https://eudml.org/doc/10644, https://semanticscholar.org/paper/f4c097f10fcbd2cf9879b8942c91a34dfd56bba8

zbMATH Keywords

substitutionssubword complexitybalanced word

Mathematics Subject Classification ID

Combinatorics on words (68R15) Automata sequences (11B85)

Recommendations

• Subword balance in binary words, languages and sequences
• Study of irreducible balanced pairs for substitutive languages
• Balances and Abelian complexity of a certain class of infinite ternary words
• Balances for fixed points of primitive substitutions.
• scientific article; zbMATH DE number 148020

Cites work

• scientific article; zbMATH DE number 1844170 (Why is no real title available?)
• scientific article; zbMATH DE number 873921 (Why is no real title available?)
• A GEOMETRIC PROOF OF THE ENUMERATION FORMULA FOR STURMIAN WORDS
• Complexity and special factors
• Intertwinings of periodic sequences
• On the number of factors of Sturmian words
• Sequences with minimal block growth
• Some combinatorial properties of Sturmian words
• Sturmian morphisms and Rauzy's rules
• Symbolic Dynamics II. Sturmian Trajectories
• Uniqueness Theorems for Periodic Functions

Cited in

(12)

• Factor-balanced \(S\)-adic languages
• scientific article; zbMATH DE number 7121035 (Why is no real title available?)
• scientific article; zbMATH DE number 148020 (Why is no real title available?)
• scientific article; zbMATH DE number 1560303 (Why is no real title available?)
• New string attractor-based complexities for infinite words
• scientific article; zbMATH DE number 782020 (Why is no real title available?)
• scientific article; zbMATH DE number 846969 (Why is no real title available?)
• Subword balance in binary words, languages and sequences
• Study of irreducible balanced pairs for substitutive languages
• Symmetrization of bounded remainder sets
• Moduli of toric tilings into bounded remainder sets and balanced words
• String attractors and infinite words

This page was built for publication: Languages under substitutions and balanced words

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