Related papers: An asymptotic version of Cobham's theorem

We study the notion of an asymptotically automatic sequence, which generalises the notion of an automatic sequence. While $k$-automatic sequences are characterised by finiteness of $k$-kernels, the $k$-kernels of asymptotically…

We present a short new proof of Cobham's theorem without using Kronecker's approximation theorem, making it suitable for generalization beyond automatic sequences.

We make certain bounds in Krebs' proof of Cobham's theorem explicit and obtain corresponding upper bounds on the length of a common prefix of an aperiodic $a$-automatic sequence and an aperiodic $b$-automatic sequence, where $a$ and $b$ are…

We study substitutive systems generated by nonprimitive substitutions and show that transitive subsystems of substitutive systems are substitutive. As an application we obtain a complete characterisation of the sets of words that can appear…

We present in this paper a new method to deal with automatic sequences. This method allows us to prove a M\"obius-randomness-principle for automatic sequences from which we deduce the Sarnak conjecture for this class of sequences.…

We present a general method to obtain asymptotic power series for three kinds of sequences. And we give recurrence relations for determining the coefficients of asymptotic power series for these sequences. As applications, we show how these…

In this article we generalize Cobham theorem to a large class of substitutions including non primitive and non constant length substitutions.

In this paper we consider asymptotic expansions for a class of sequences of symmetric functions of many variables. Applications to classical and free probability theory are discussed.

Confidence sequences are anytime-valid analogues of classical confidence intervals that do not suffer from multiplicity issues under optional continuation of the data collection. As in classical statistics, asymptotic confidence sequences…

In this work we extend our study on a link between automaticity and certain algebraic power series over finite fields. Our starting point is a family of sequences in a finite field of characteristic $2$, recently introduced by the first…

Some asymptotic notions for random variables are discussed. In particular, different versions of O and o for sequences of random variables are studied. The results are elementary and more or less well-known, but collected here for future…

Asymptotic almost automorphy is introduced and studied in the context of some algebras of generalized functions. We also give applications to neutral difference differential systems in the framework of such generalized functions.

Asymptotic statistical theory for estimating functions is reviewed in a generality suitable for stochastic processes. Conditions concerning existence of a consistent estimator, uniqueness, rate of convergence, and the asymptotic…

Cobham's theorem asserts that if a sequence is automatic with respect to two multiplicatively independent bases, then it is ultimately periodic. We prove a stronger density version of the result: if two sequences which are automatic with…

In this paper, we prove that a class of regular sequences can be viewed as projections of fixed points of uniform morphisms on a countable alphabet, and also can be generated by countable states automata. Moreover, we prove that the…

Automatic sequences have many properties that other sequences (in particular, non-uniformly morphic sequences) do not necessarily share. In this paper we survey a number of different methods that can be used to prove that a given sequence…

Asymptotic expansions for a wide class of distribution are studied. A simple method for computation of the series coefficients is suggested. The case when regularization parameter of the distribution depends on the asymptotic parameter is…

We obtain a complete classification of complex-valued sequences which are both multiplicative and automatic.

We introduce the notion of perturbations of quantum stochastic models using the series product, and establish the asymptotic convergence of sequences of quantum stochastic models under the assumption that they are related via a right series…

We give a new graph-theoretic proof of Cobham's Theorem which says that the support of an automatic sequence is either sparse or grows at least like $N^\alpha$ for some $\alpha > 0$. The proof uses the notions of tied vertices and cycle…