About frequencies of letters in generalized automatic sequences

DOI10.1016/J.TCS.2006.11.013zbMath1162.68032OpenAlexW2018213313MaRDI QIDQ1022583

Michel Rigo, Samuel Nicolay

Publication date: 22 June 2009

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2006.11.013

zbMATH Keywords

automatic sequencesabstract numeration systemsfrequency of letters

Mathematics Subject Classification ID

Combinatorics on words (68R15)

Related Items (4)

Asymptotic properties of free monoid morphisms ⋮ Multidimensional generalized automatic sequences and shape-symmetric morphic words ⋮ A Characterization of Multidimensional <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"><mml:mi>S</mml:mi></mml:math>-Automatic Sequences ⋮ Logarithmic frequency in morphic sequences

Cites Work

• Substitutions in dynamics, arithmetics and combinatorics
• The asymptotic distribution of elements in automatic sequences
• Additive functions with respect to numeration systems on regular languages
• Generalization of automatic sequences for numeration systems on a regular language
• On the representation of real numbers using regular languages
• Automatic Sequences
• An Introduction to Symbolic Dynamics and Coding
• Developments in Language Theory
• Uniform tag sequences
• Numeration systems on a regular language
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: About frequencies of letters in generalized automatic sequences