Related papers: $\mathbb{N}$-polyregular functions arise from well…
The starting point of algebraic language theory is that regular languages of finite words are exactly those recognized by finite monoids. This finiteness condition gives rise to a topological space whose points, called profinite words,…
Many applications of denotational semantics, such as higher-order model checking or the complexity of normalization, rely on finite semantics for monomorphic type systems. We exhibit such a finite semantics for a polymorphic purely linear…
Notions of a "holomorphic" function theory for functions of a split-quaternionic variable have been of recent interest. We describe two found in the literature and show that one notion encompasses a small class of functions, while the other…
In this paper we present several new classes of logarithmically completely monotonic functions. Our functions have in common that they are defined in terms of the $q-$gamma and $q-$digamma functions. As an applications of this results, some…
The concept of monogenic functions over real alternative $\ast$-algebras has recently been introduced to unify several classical monogenic (or regular) functions theories in hypercomplex analysis, including quaternionic, octonionic, and…
In this paper which is the first of a series of papers on smooth structures, the concepts of C-structures and smooth structures are introduced and studied. The notion of smooth structure on semi-integral domains is given. It is shown that…
The almost periodic functions form a natural example of a non-separable normed space. As such, it has been a challenge for constructive mathematicians to find a natural treatment of them. Here we present a simple proof of Bohr's fundamental…
We employ the notions of `sequential function' and `interrogation' (dialogue) in order to define new partial combinatory algebra structures on sets of functions. These structures are analyzed using J. Longley's preorder-enriched category of…
This paper studies which functions computed by $\mathbb{Z}$-weighted automata can be realized by $\mathbb{N}$-weighted automata, under two extra assumptions: commutativity (the order of letters in the input does not matter) and polynomial…
We know extensions of first order logic by quantifiers of the kind "there are uncountable many ...", "most ..." with new axioms and appropriate semantics. Related are operations such as "set of x, such that ...", Hilbert's…
Different questions lead to the same class of functions from natural integers to integers: those which have integral difference ratios, i.e. verifying $f(a)-f(b)\equiv0 \pmod {(a-b)}$ for all $a>b$. We characterize this class of functions…
A generalization of numeration system in which the set N of the natural numbers is recognizable by finite automata can be obtained by describing a lexicographically ordered infinite regular language. Here we show that if P belonging to Q[x]…
We prove that all standard subregular language classes are linearly separable when represented by their deciding predicates. This establishes finite observability and guarantees learnability with simple linear models. Synthetic experiments…
A $G$-grading on a complex semisimple Lie algebra $L$, where $G$ is a finite abelian group, is called quasi-good if each homogeneous component is 1-dimensional and 0 is not in the support of the grading. Analogous to classical root systems,…
Slice-regular functions of a quaternionic variable have been studied extensively in the last 12 years, resulting, in many ways, quite close to classical holomorphic functions of a complex variable; indeed, there is a correspondence between…
We introduce the notion of a bounded weight function on a language, and show that the set of bounded weight functions on a regular language is a rational polyhedral cone. We study the cell recognised by a bounded weight function (that is,…
In this paper we study some fundamental algebraic properties of slice functions and slice regular functions over an alternative $^*$-algebra $A$ over $\mathbb{R}$. These recently introduced function theories generalize to higher dimensions…
We give the theorem of coincidence of a class of functions defined by a generalised modulus of smoothness with a class of functions defined by the order of the best approximation by algebraic polynomials. We also prove the appropriate…
A class of real functions, which is the generalization of a family of convex functions, is introduced; in this connection, we have defined $X$-convex, strictly $X$-convex, quasi-$X$-convex, strictly quasi-$X$-convex, and semi-strictly…
We prove two main results on Denjoy-Carleman classes: (1) a composite function theorem which asserts that a function f(x) in a quasianalytic Denjoy-Carleman class Q, which is formally composite with a generically submersive mapping y=h(x)…