Related papers: Finite automata and algebraic extensions of functi…
While automata theory often concerns itself with regular predicates, relations corresponding to acceptance by a finite state automaton, in this article we study the regular functions, such relations which are also functions in the…
The theory of finite automata concerns itself with words in a free monoid together with concatenation and without further structure. There are, however, important applications which use alphabets which are structured in some sense. We…
For finite extensions of a rational function field over a finite field, we prove a "P-adic class formula" in the spirit Taelman's work.
The $\beta\gamma$ system is generalized by complex(rational) powers of the fields, which leads to a corresponding extension on the Fock space. Two different approaches to compute the Green functions of the physical operators are proposed.…
The paper deals with Henselian valued field with analytic structure. Actually, we are focused on separated analytic structures, but the results remain valid for strictly convergent analytic ones as well. A classical example of the latter is…
Let $p(x) \in C(x)$ be a rational function satisfying the condition $p(0)=1$ and $q$ an integer larger than $1$, in this article we will consider the power expansion of the infinite product…
Affine automata provide a finite-state computational model that preserves the linear-algebraic structure of quantum computation while operating entirely over the reals. Recent work has shown that affine automata can far surpass classical…
Following Douady-Hubbard and Bartholdi-Nekrashevych, we give an algebraic formulation of Thurston's characterization of rational functions. The techniques developed are applied to the analysis of the dynamics on the set of free homotopy…
Structural operational semantics can be studied at the general level of distributive laws of syntax over behaviour. This yields specification formats for well-behaved algebraic operations on final coalgebras, which are a domain for the…
We prove a uniform version of non-Archimedean Yomdin-Gromov parametrizations in a definable context with algebraic Skolem functions in the residue field. The parametrization result allows us to bound the number of F_q[t]-points of bounded…
We conjecture that bounded generalised polynomial functions cannot be generated by finite automata, except for the trivial case when they are periodic away from a finite set. Using methods from ergodic theory, we are able to partially…
We establish a quantitative approximation formula of the Lyapunov exponent of a rational function of degree more than one over an algebraically closed field of characteristic $0$ that is complete with respect to a non-trivial and possibly…
Finite automata are used to encode geometric figures, functions and can be used for image compression and processing. The original approach is to represent each point of a figure in $\mathbb{R}^n$ as a convolution of its $n$ coordinates…
The theory of abstract argumentation frameworks (afs) has, in the main, focused on finite structures, though there are many significant contexts where argumentation can be regarded as a process involving infinite objects. To address this…
This paper presents the first step of a wider research effort to apply tree automata completion to the static analysis of functional programs. Tree Automata Completion is a family of techniques for computing or approximating the set of…
Building on the seminal work of Gromov on endomorphisms of symbolic algebraic varieties [10], we introduce a notion of cellular automata over schemes which generalize affine algebraic cellular automata in [7]. We extend known results to…
The Nottingham group at 2 is the group of (formal) power series $t+a_2 t^2+ a_3 t^3+ \cdots$ in the variable $t$ with coefficients $a_i$ from the field with two elements, where the group operation is given by composition of power series.…
We propose another interpretation of well-known derivatives computations from regular expressions, due to Brzozowski, Antimirov or Lombardy and Sakarovitch, in order to abstract the underlying data structures (e.g. sets or linear…
In this document, we propose a description, via a Haskell implementation, of a generalization of the notion of regular expression allowing us to group the definitions and the methods of (tree or word) automata constructions over one generic…
Over an algebraically closed field of positive characteristic, there exist rational functions with only one critical point. We give an elementary characterization of these functions in terms of their continued fraction expansions. Then we…