We present some asymptotic results about the frequency of a letter appearing in a generalized unidimensional automatic sequence. Next, we study multidimensional generalized automatic sequences and the corresponding frequencies. (C) 2006 Elsevier B.V. All rights reserved
We study the random variable Yn representing the number of occurrences of a symbol a in a word of le...
We show that various aspects of k-automatic sequences — such as having an unbordered factor of lengt...
17 pagesWe introduce the notion of an asymptotically automatic sequence, which generalises the notio...
peer reviewedWe present some asymptotic results about the frequency of a letter appearing in a gener...
Abstract. We present some asymptotic results about the frequency of a letter appearing in a generali...
AbstractWe present some asymptotic results about the frequency of a letter appearing in a generalize...
Automatic sequences are sequences which are produced by a finite automaton. Although they are not ra...
peer reviewedWe give some generalizations of $k$-automatic sequences replacing the $k$-ary system by...
The classical Kolakoski sequence is the unique sequence of two symbols {1,2}, starting with 1, which...
Let a finite alphabet Ω. We consider a sequence of letters from Ω generated by a discrete time semi-...
We study the random variable Yn representing the number of occurrences of a symbol a in a word of l...
AbstractDirichlet series whose coefficients are generated by finite automata define meromorphic func...
This work investigates frequency distributions of strings within a text. The mathematical derivation...
AbstractWe give some sufficient criteria for the existence of certain averages (mean, correlation fu...
14 pagesInternational audienceWe show that automatic sequences are asymptotically orthogonal to peri...
We study the random variable Yn representing the number of occurrences of a symbol a in a word of le...
We show that various aspects of k-automatic sequences — such as having an unbordered factor of lengt...
17 pagesWe introduce the notion of an asymptotically automatic sequence, which generalises the notio...
peer reviewedWe present some asymptotic results about the frequency of a letter appearing in a gener...
Abstract. We present some asymptotic results about the frequency of a letter appearing in a generali...
AbstractWe present some asymptotic results about the frequency of a letter appearing in a generalize...
Automatic sequences are sequences which are produced by a finite automaton. Although they are not ra...
peer reviewedWe give some generalizations of $k$-automatic sequences replacing the $k$-ary system by...
The classical Kolakoski sequence is the unique sequence of two symbols {1,2}, starting with 1, which...
Let a finite alphabet Ω. We consider a sequence of letters from Ω generated by a discrete time semi-...
We study the random variable Yn representing the number of occurrences of a symbol a in a word of l...
AbstractDirichlet series whose coefficients are generated by finite automata define meromorphic func...
This work investigates frequency distributions of strings within a text. The mathematical derivation...
AbstractWe give some sufficient criteria for the existence of certain averages (mean, correlation fu...
14 pagesInternational audienceWe show that automatic sequences are asymptotically orthogonal to peri...
We study the random variable Yn representing the number of occurrences of a symbol a in a word of le...
We show that various aspects of k-automatic sequences — such as having an unbordered factor of lengt...
17 pagesWe introduce the notion of an asymptotically automatic sequence, which generalises the notio...
DOI
Add to ORKG