Related papers: Automatic supermartingales acting on sequences
We study those automatic sequences which are produced by an automaton whose underlying graph is the Cayley graph of a finite group. For $2$-automatic sequences, we find a characterization in terms of what we call homogeneity, and among…
A commutative semigroup of abstract factorials is defined in the context of the ring of integers. We study such factorials for their own sake, whether they are or are not connected to sets of integers. Given a subset X of the positive…
We study the existence of automatic presentations for various algebraic structures. An automatic presentation of a structure is a description of the universe of the structure by a regular set of words, and the interpretation of the…
In the context of Higman embeddings of recursive groups into finitely presented groups we suggest an algorithm which uses Higman operations to explicitly constructs the specific recursively enumerable sets of integer sequences arising…
Finite automata with weights in the max-plus semiring are considered. The main result is: it is decidable in an effective way whether a series that is recognized by a finitely ambiguous max-plus automaton is unambiguous, or is sequential. A…
A stationary random sequence admits under some assumptions a representation as the sum of two others: one of them is a martingale difference sequence, and another is a so-called coboundary. Such a representation can be used for proving some…
We study the pseudorandomness of automatic sequences in terms of well-distribution and correlation measure of order 2. We detect non-random behavior which can be derived either from the functional equations satisfied by their generating…
We give characterizations of unital uniform topological algebras and saturated locally multiplicatively convex algebras by means of multiplicative linear functionals. Some automatic continuity theorems in advertibly complete uniform…
This paper introduces and studies a notion of \emph{algorithmic randomness} for subgroups of rationals. Given a randomly generated additive subgroup $(G,+)$ of rationals, two main questions are addressed: first, what are the model-theoretic…
Abstract numeration systems encode natural numbers using radix ordered words of an infinite regular language and linear recurrence sequences play a key role in their valuation. Sequence automata, which are deterministic finite automata with…
We introduce a new class of semigroups arising from a restricted class of asynchronous automata. We call these semigroups "expanding automaton semigroups." We show that the class of synchronous automaton semigroups is strictly contained in…
A quasi-automatic semigroup is defined by a finite set of generators, a rational (regular) set of representatives, such that if a is a generator or neutral, then the graph of right multiplication by a on the set of representatives is a…
This paper discusses iterated monodromy groups for transcendental functions. We show that for every post-singularly finite entire transcendental function, the iterated monodromy action can be described by bounded activity automata of a…
In this work, we analyze the combinatorial properties of cylinders and subdivisions of augmented semi-simplicial sets. These constructions are obtained as particular cases of a certain action from a co-semi-simplicial set on an augmented…
The important application of semi-static hedging in financial markets naturally leads to the notion of quasi self-dual processes which is, for continuous semimartingales, related to symmetry properties of both their ordinary as well as…
New proofs are given of the existence of the compensator (or dual predictable projection) of a locally integrable c\'adl\'ag adapted process of finite variation and of the existence of the quadratic variation process for a c\'adl\'ag local…
We characterize complete deterministic finite automata with two input letters in which every non-empty set of states occurs as the image of the whole state set under the action of a suitable input word. The characterization leads to a…
We construct a family of self-similar Markov martingales with given marginal distributions. This construction uses the self-similarity and Markov property of a reference process to produce a family of Markov processes that possess the same…
We define recurrence matrices and study a few properties (links with automatic sequences, branch groups etc.) of them.
We introduce the class of synchronous subsequential relations, a subclass of the synchronous relations which embodies some properties of subsequential relations. If we take relations of this class as forming the possible transitions of an…