Related papers: Positionality of Dumont--Thomas numeration systems…
We are entering a new era in which software systems are becoming more and more complex and larger. So, the composition of such systems is becoming infeasible by manual means. To address this challenge, self-organising software models…
Let p/q be a rational number. Numeration in base p/q is defined by a function that evaluates each finite word over A_p={0,1,...,p-1} to some rational number. We let N_p/q denote the image of this evaluation function. In particular, N_p/q…
In the course of many mathematical developments involving 'number systems' like $\mathbb{N}, \mathbb{Z}, \mathbb{Q}, \mathbb{R}, \mathbb {C}$ etc., it sometimes becomes necessary to abstract away and study certain properties of the number…
The technique of abstracting abstract machines (AAM) provides a systematic approach for deriving computable approximations of evaluators that are easily proved sound. This article contributes a complementary step-by-step process for…
This paper proposes an alternative to standard first-order logic that seeks greater naturalness, generality, and semantic self-containment. The system removes the first-order restriction, avoids type hierarchies, and dispenses with external…
We investigate an extension of nominal many-sorted signatures in which abstraction has a form of instantiation, called generalised concretion, as elimination operator (similarly to lambda-calculi). Expressions are then classified using a…
Turing's famous 'machine' framework provides an intuitively clear conception of 'computing with real numbers'. A recursive counterexample to a theorem shows that the theorem does not hold when restricted to computable objects. These…
We show that alternating Turing machines, with a novel and natural definition of acceptance, accept precisely the inductive (Pi-1-1) languages. Total alternating machines, that either accept or reject each input, accept precisely the…
A Lie system is a nonautonomous system of first-order differential equations possessing a superposition rule, i.e. a map expressing its general solution in terms of a generic finite family of particular solutions and some constants.…
We define a notion of randomness for individual and collections of formal languages based on automatic martingales acting on sequences of words from some underlying domain. An automatic martingale bets if the incoming word belongs to the…
The foundational concepts of semantic numeration systems theory are briefly outlined. The action of cardinal semantic operators unfolds over a set of cardinal abstract entities belonging to the cardinal semantic multeity. The cardinal…
The notion of a k-automatic set of integers is well-studied. We develop a new notion - the k-automatic set of rational numbers - and prove basic properties of these sets, including closure properties and decidability.
Deciding formulas mixing arithmetic and uninterpreted predicates is of practical interest, notably for applications in verification. Some decision procedures consist in building by structural induction an automaton that recognizes the set…
Several abstract machines that operate on symbolic input alphabets have been proposed in the last decade, for example, symbolic automata or lattice automata. Applications of these types of automata include software security analysis and…
We consider Cantor real numeration system as a frame in which every non-negative real number has a positional representation. The system is defined using a bi-infinite sequence $\Beta=(\beta_n)_{n\in\Z}$ of real numbers greater than one. We…
Lehmer's totient problem asks if there exists a composite number $d$ such that its totient divide $d-1$. In this article we generalize the Lehmer's totient problem in algebraic number fields. We introduce the notion of a Lehmer number.…
This paper proposes an alternative language for expressing results of the algorithmic theory of randomness. The language is more precise in that it does not involve unspecified additive or multiplicative constants, making mathematical…
We present a base class of automata that induce a numeration system and we give an algorithm to give the n-th word in the language of the automaton when the expansion of n in the induced numeration system is feeded to the automaton.…
We define the Thue-Morse transform T on a class of infinite binary words. It sends the alternating word a_0 = 010101... to the Thue-Morse sequence. We then study its orbit a_m = T^m(a_0) as well as the sequences u_m and v_m giving…
We give a concise historical background to Montmort's matching problem and its modern variants such as the hat-check problem, then develop a unified counting framework for fixed-point-free allocations. Using elementary recurrence and…