Related papers: Finite automata and algebraic extensions of functi…
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…
We study rational functions over finite fields under PGL-equivalence. We say that $f, g \in \Bbb F_q(X)$ are \emph{equivalent} if there exist $\psi, \phi \in \Bbb F_q(X)$ of degree one such that $g = \psi \circ f \circ \phi$. Most…
Nominal sets provide a framework to study key notions of syntax and semantics such as fresh names, variable binding and $\alpha$-equivalence on a conveniently abstract categorical level. Coalgebras for endofunctors on nominal sets model,…
We establish asymptotic formulas for counting rational points near finite type curves on the plane, generalizing Huang's result.
What is computable with limited resources? How can we verify the correctness of computations? How to measure computational power with precision? Despite the immense scientific and engineering progress in computing, we still have only…
We present a class of algorithms based on rational Krylov methods to compute the action of a generalized matrix function on a vector. These algorithms incorporate existing methods based on the Golub-Kahan bidiagonalization as a special…
We express the asymptotics of the remainders of the partial sums {s_n} of the generalized hypergeometric function q+1_F_q through an inverse power series z^n n^l \sum_k c_k/n^k, where the exponent l and the asymptotic coefficients {c_k} may…
This paper introduces the structure of operated polygraphs as a categorical model for rewriting in operated algebras, generalizing Gr\"obner-Shirshov bases with non-monomial termination orders. We provide a combinatorial description of…
For every prime $p$ it is shown that a wide class of HNN extensions of free abelian groups admit faithful representation by finite $p$-automata.
We revisit Christol's theorem on algebraic power series in positive characteristic and propose yet another proof for it. This new proof combines several ingredients and advantages of existing proofs, which make it very well-suited for…
There are several remarks on Hilbert series of finitely presented (f. p.) associative algebras over a field and their modules. First, given an integer $D$, the set of Hilbert series of right-sided ideals with generators and relations of…
The paper is devoted to two types of algebraic models of automata. The usual (first type) model leads to the developed decomposition theory (Krohn-Rhodes theory). We introduce another type of automata model and study how these automata are…
We introduce classical and non-deterministic finite automata associated with representations of the braid group. After briefly reviewing basic definitions on finite automata, Coxeter's groups and the associated word problem, we turn to the…
Inspired by the theory of Hodge correlators due to Goncharov and by the plectic principle of Nekov\'a\v{r} and Scholl, we construct higher plectic Green functions and give a higher order generalization of Hecke's formula for abelian…
Over the last 20 years a large number of automata-based specification theories have been proposed for modeling of discrete,real-time and probabilistic systems. We have observed a lot of shared algebraic structure between these formalisms.…
We study a categorical generalisation of tree automata, as $\Sigma$-algebras for a fixed endofunctor $\Sigma$ endowed with initial and final states. Under mild assumptions about the base category, we present a general minimisation algorithm…
Consider a rational map from a projective space to a product of projective spaces, induced by a collection of linear projections. Motivated by the the theory of limit linear series and Abel-Jacobi maps, we study the basic properties of the…
Using infinite compositions, we solve the general equations $P(\lambda w) = p(w)f(P(w))$ for holomorphic functions $p$ and $f$. We describe the situations in which this equation is palpable; and their effectiveness at describing dynamical…
We define a new subclass of nondeterministic finite automata for prefix-closed languages called Flanked Finite Automata (FFA). We show that this class enjoys good complexity properties while preserving the succinctness of nondeterministic…
Let K be a function field, let f be a rational function of degree d at least 2 defined over K, and suppose that f is not isotrivial. In this paper, we show that a point P in P^1(Kbar) has f-canonical height zero if and only if P is…