Related papers: Automatic Sequences and Curves over Finite Fields
Let L be an infinite regular language on a totally ordered alphabet (A,<). Feeding a finite deterministic automaton (with output) with the words of L enumerated lexicographically with respect to < leads to an infinite sequence over the…
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 give an asymptotic lower bound on the number of field extensions generated by algebraic points on superelliptic curves over $\mathbb{Q}$ with fixed degree $n$ and discriminant bounded by $X$. For $C$ a fixed such curve given by an affine…
We study and explicitly construct some families of asymptotically exact sequences of algebraic function fields. It turns out that these families have an asymptotical class number widely greater than the general Lachaud - Martin-Deschamps…
To a simple graph we associate a so-called graph series, which can be viewed as the Hilbert--Poincar\'e series of a certain infinite jet scheme. We study new $q$-representations and examine modular properties of several examples including…
The axioms of iteration theories, or iteration categories, capture the equational properties of fixed point operations in several computationally significant categories. Iteration categories may be axiomatized by the Conway identities and…
An automatic sequence is a letter-to-letter coding of a fixed point of a uniform morphism. More generally, we have morphic sequences, which are letter-to-letter codings of fixed points of arbitrary morphisms. There are many examples where…
A rationally dynamically algebraic (RDA) power series is one that arises as (a component of) the solution of a system of differential equations of the form $\boldsymbol{y}' = F(\boldsymbol{y})$, where $F$ is a vector of rational functions…
Geometric semigroup theory is the systematic investigation of finitely-generated semigroups using the topology and geometry of their associated automata. In this article we show how a number of easily-defined expansions on finite semigroups…
In this paper we use the framework of automatic sequences to study combinatorial sequences modulo prime powers. Given a sequence whose generating function is the diagonal of a rational power series, we provide a method, based on work of…
In this paper we define a way to get a bounded invertible automaton starting from a finite graph. It turns out that the corresponding automaton group is regular weakly branch over its commutator subgroup, contains a free semigroup on two…
In this paper we consider some classical varieties of linear algebras over the field which has characteristic 0. For every considered variety we take a category of the finite generated free algebras of this variety. And for every this…
We show that various aspects of k-automatic sequences -- such as having an unbordered factor of length n -- are both decidable and effectively enumerable. As a consequence it follows that many related sequences are either k-automatic or…
This paper presents a formula for $a$-number of certain maximal curves characterized by the equation $y^{\frac{q+1}{2}} = x^m + x$ over the finite field $\mathbb{F}_{q^2}$. $a$-number serves as an invariant for the isomorphism class of the…
We extend the classical Stallings theory (describing subgroups of free groups as automata) to direct products of free and abelian groups: after introducing enriched automata (i.e., automata with extra abelian labels), we obtain an explicit…
Certain fermionic quantum field theories are equivalent to probabilistic cellular automata, with fermionic occupation numbers associated to bits. We construct an automaton that represents a discrete model of spinor gravity in four…
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…
The number A(q) is the upper limit of the ratio of the maximum number of points of a curve defined over $\Fq$ to the genus. By constructing class field towers with good parameters we present improvements of lower bounds of A(q) for q an odd…
It is shown that the Hecke-Kiselman algebra associated to a finite directed graph is an automaton algebra in the sense of Ufnarovskii. Consequently, its Gelfand-Kirillov dimension is an integer if it is finite. As a consequence, it is…
Hereditarily finite (HF) set theory provides a standard universe of sets, but with no infinite sets. Its utility is demonstrated through a formalisation of the theory of regular languages and finite automata, including the Myhill-Nerode…