Related papers: Strongly Almost Periodic Sequences under Finite Au…
The paper studies different variants of almost periodicity notion. We introduce the class of eventually strongly almost periodic sequences where some suffix is strongly almost periodic (=uniformly recurrent). The class of almost periodic…
Almost periodicity has been considered in Formal Language Theory in connection with some topics in Symbolic Dynamics. In (P\u{a}un and Marcus, Bulletin of EATCS 53 (1994)) some problems concerning this property are raised. For instance it…
In some particular cases we give criteria for morphic sequences to be almost periodic (=uniformly recurrent). Namely, we deal with fixed points of non-erasing morphisms and with automatic sequences. In both cases a polynomial-time algorithm…
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…
The paper is a survey of notions and results related to classical and new generalizations of the notion of a periodic sequence. The topics related to almost periodicity in combinatorics on words, symbolic dynamics, expressibility in logical…
We study automatic sequences and automatic systems generated by general constant length (nonprimitive) substitutions. While an automatic system is typically uncountable, the set of automatic sequences is countable, implying that most…
Morphic sequences form a natural class of infinite sequences, extending the well-studied class of automatic sequences. Where automatic sequences are known to have several equivalent characterizations and the class of automatic sequences is…
This article consists in two independent parts. In the first one, we investigate the geometric properties of almost periodicity of model sets (or cut-and-project sets, defined under the weakest hypotheses); in particular we show that they…
In the classic problem of sequence prediction, a predictor receives a sequence of values from an emitter and tries to guess the next value before it appears. The predictor masters the emitter if there is a point after which all of the…
We present a notion of almost periodicity wich can be applied to random dynamical systems as well as almost periodic stochastic differential equations in Hilbert spaces (abstract stochastic partial differential equations). This concept…
We study the set of strictly periodic points in surjective cellular automata, i.e., the set of those configurations which are temporally periodic for a given automaton but they not spatially periodic. This set turns out to be dense for…
In this paper, we first give the definition of random almost periodic solutions of random dynamical systems and give some examples. Then, we prove the existence of such random almost periodic solutions. Further, we introduce the definition…
We introduce a notion of strong periodicity of a module over a finite-dimensional algebra over a field. We prove that the existence of such modules over certain idempotent algebras is both a necessary and sufficient condition for the…
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…
Quasi-Sturmian words, which are infinite words with factor complexity eventually $n+c$ share many properties with Sturmian words. In this paper, we study the quasi-Sturmian colorings on regular trees. There are two different types, bounded…
We show that almost split sequences in the category of comodules over a coalgebra with finite-dimensional right-hand term are direct limits of almost split sequences over finite dimensional subcoalgebras. In previous work we showed that…
By replacing the letters to polynomials in F_2[t], an infinite word, over a finite alphabet, can be seen as the sequence of partial quotients of a continued fraction in F_2((1/t)). Here is described a family of such infinite words,…
In the following pages we discuss infinite sequences defined on a finite alphabet, and more specially those which are generated by finite automata. We have divided our paper into seven parts which are more or less self-contained. Needless…
A continuous-time dynamical system with parameter $\varepsilon$ is nearly-periodic if all its trajectories are periodic with nowhere-vanishing angular frequency as $\varepsilon$ approaches 0. Nearly-periodic maps are discrete-time analogues…
An infinite word x is said to be quasiperiodic if there exists a finite word q such that x is covered by occurrences of q (such a q is called a quasiperiod of x). Using the notion of derivation, we show that this definition is not…