Logarithmic frequency in morphic sequences
This paper answers a question raised by [\textit{J.-P. Allouche} and \textit{J. Shallit}, Automatic sequences. Theory, applications, generalizations. Cambridge: Cambridge University Press (2003; Zbl 1086.11015)] by showing that the logarithmic frequency of letters appearing in a morphic sequence always exists. This extends a result of \textit{A. Cobham} [Math. Syst. Theory 6, 164--192 (1972; Zbl 0253.02029)] showing that the logarithmic frequency of letters appearing in an automatic sequence always exists, while the natural frequency need not exist.
- The upper density of an automatic set is rational
- Second-order ergodic theorem for self-similar tiling systems
- On the Frequency of Letters in Morphic Sequences
- (Logarithmic) densities for automatic sequences along primes and squares
- Developments in Language Theory
- Letter frequency vs factor frequency in pure morphic words
- The characteristic sequence of the integers that are the sum of two squares is not morphic
- Relative position in binary substitutions
- On the finite factorial numbers
This page was built for publication: Logarithmic frequency in morphic sequences
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1011951)
