Related papers: Ostrowski numeration systems, addition and finite …
We determine the asymptotic proportion of minimal automata, within n-state accessible deterministic complete automata over a k-letter alphabet, with the uniform distribution over the possible transition structures, and a binomial…
The theory of addition in the domains of natural (N), integer (Z), rational (Q), real (R) and complex (C) numbers is decidable, so is the theory of multiplication in all those domains. By Godel's Incompleteness Theorem the theory of…
The numerical evaluation of statistics plays a crucial role in statistical physics and its applied fields. It is possible to evaluate the statistics for a stochastic differential equation with Gaussian white noise via the corresponding…
In this paper we regard languages and their acceptors - such as deterministic or weighted automata, transducers, or monoids - as functors from input categories that specify the type of the languages and of the machines to categories that…
Many nonlinear systems can be described by a Wiener-Schetzen model. In this model, the linear dynamics are formulated in terms of orthonormal basis functions (OBFs). The nonlinearity is modeled by a multivariate polynomial. In general, an…
This article studies the expressive power of finite automata recognizing sets of real numbers encoded in positional notation. We consider Muller automata as well as the restricted class of weak deterministic automata, used as symbolic set…
In this paper we regard languages and their acceptors -- such as deterministic or weighted automata, transducers, or monoids -- as functors from input categories that specify the type of the languages and of the machines to categories that…
TThe problem is to identify a probability associated with a set of natural numbers, given an infinite data sequence of elements from the set. If the given sequence is drawn i.i.d. and the probability mass function involved (the target)…
We show that the local period at position n in a characteristic Sturmian word can be given in terms of the Ostrowski representation for n + 1.
Given a natural number $n \geq 1$, the odometer semigroup $O_n$, also known as the adding machine or the Baumslag-Solitar monoid with two generators, is a well-known object in group theory. This paper examines the odometer semigroup in…
In this article, we propose a variant of the usual Ostrowski $\alpha$-numeration (where $\alpha$ is a real in [0, 1[) that codes integers (positive as well as negative) and reals of [0, 1[ (instead of [--$\alpha$, 1--$\alpha$[), so that for…
To each one-dimensional subshift $X$, we may associate a winning shift $W(X)$ which arises from a combinatorial game played on the language of $X$. Previously it has been studied what properties of $X$ does $W(X)$ inherit. For example, $X$…
One-Counter Nets (OCNs) are finite-state automata equipped with a counter that is not allowed to become negative, but does not have zero tests. Their simplicity and close connection to various other models (e.g., VASS, Counter Machines and…
Kolmogorov complexity and algorithmic probability are defined only up to an additive resp. multiplicative constant, since their actual values depend on the choice of the universal reference computer. In this paper, we analyze a natural…
We present a dynamical and spectral study of Ostrowski's map based on the use of transfer operators. The Ostroswki dynamical system is obtained as a skew-product of the Gauss map (it has the Gauss map as a base and interval fibers) and…
The theories of system identification have been highly elaborated so as to achieve the true system. This paper much discuses regarding the stochastic processes along with the divergent of whether or not the system has zero-mean under…
We describe a new algorithm that computes the n-th Bernoulli number in n^(4/3 + o(1)) bit operations. This improves on previous algorithms that had complexity n^(2 + o(1)).
For an irrational $\alpha\in(0,1)$, we investigate the Ostrowski sum-of-digits function $\sigma_\alpha$. For $\alpha$ having bounded partial quotients and $\vartheta\in\mathbb R\setminus\mathbb Z$, we prove that the function $g:n\mapsto…
In this note, we present a characterization of sets definable in Skolem arithmetic, i.e., the first-order theory of natural numbers with multiplication. This characterization allows us to prove the decidability of the theory. The idea is…
We propose a new algorithm for computing validated bounds for the solutions to the first order variational equations associated to ODEs. These validated solutions are the kernel of numerics computer-assisted proofs in dynamical systems…