Related papers: Negative bases and automata
We develop constructions for exchangeable sequences of point processes that are rendered conditionally-i.i.d. negative binomial processes by a (possibly unknown) random measure called the base measure. Negative binomial processes are useful…
This work is a contribution to the study of set of the representations of integers in a rational base number system. This prefix-closed subset of the free monoid is naturally represented as a highly non regular tree whose nodes are the…
Consider a non-standard numeration system like the one built over the Fibonacci sequence where nonnegative integers are represented by words over $\{0,1\}$ without two consecutive 1. Given a set $X$ of integers such that the language of…
Consider $\alpha \in \Q(i)$ satisfying $|\alpha| >1$. Let $\D = \{0,1,\ldots,|a_0|-1\}$, where $a_0$ is the independent coefficient of the minimal primitive polynomial of $\alpha$. We introduce a way of expanding complex numbers in base…
In the present paper we want to focus on this dichotomy of the non-normal numbers -- on the one hand they are a set of measure zero and on the other hand they are residual -- for dynamical system fulfilling the specification property. These…
In this work we introduce new generalised quantifiers which allow us to express the Rabin-Mostowski index of automata. Our main results study expressive power and decidability of the monadic second-order (MSO) logic extended with these…
Reversible weighted automata are introduced and considered in a specific setting where the weights are taken from a nontrivial locally finite commutative ring such as a finite field. It is shown that the supports of series realised by such…
We study sources of isomorphisms of additive cellular automata on finite groups (called index-group). It is shown that many isomorphisms (called regular) of automata are reducible to the isomorphisms of underlying algebraic structures (such…
We discuss the use of negative bases in automatic sequences. Recently the theorem-prover Walnut has been extended to allow the use of base (-k) to express variables, thus permitting quantification over Z instead of N. This enables us to…
A set $A$ of nonnegative integers is an asymptotic basis of order $h$ if every sufficiently large integer can be represented as the sum of $h$ not necessarily distinct elements of $A$. The asymptotic basis $A$ is minimal if removing any…
In this paper we study digit frequencies in the setting of expansions in non-integer bases, and self-affine sets with non-empty interior. Within expansions in non-integer bases we show that if $\beta\in(1,1.787\ldots)$ then every…
We examine the sum of modified Bessel functions with argument depending non-linearly on the summation index given by \[S_{\nu,p}(a)=\sum_{n\geq 1} (an^p/2)^{-\nu} K_\nu(an^p)\qquad (a>0,\ 0\leq\nu<1)\] as the parameter $a\to 0+$, where $p$…
The computation and inversion of the binomial and negative binomial cumulative distribution functions play a key role in many applications. In this paper, we explain how methods used for the central beta distribution function (described in…
The Bernoulli convolution associated to the real $\beta>1$ and the probability vector $(p_0,..,p_{d-1})$ is a probability measure $\eta_{\beta,p}$ on $\mathbb R$, solution of the self-similarity relation…
We extend abstract interpretation for the purpose of verifying hybrid systems. Abstraction has been playing an important role in many verification methodologies for hybrid systems, but some special care is needed for abstraction of…
A new class of languages of infinite words is introduced, called the max-regular languages, extending the class of $\omega$-regular languages. The class has two equivalent descriptions: in terms of automata (a type of deterministic counter…
We introduce an automata model for data words, that is words that carry at each position a symbol from a finite alphabet and a value from an unbounded data domain. The model is (semantically) a restriction of data automata, introduced by…
Let \beta_n>1 be a root of x^n-x-1 for n=4,5,... We will prove that \beta_n is not a Parry number, i.e., the associated beta transformation does not correspond a sofic symbolic system. A generalization is shown in the last section.
We introduce a modified version of P. Jones's $\beta$-numbers for Carnot groups which we call {\it stratified $\beta$-numbers}. We show that an analogue of Jones's traveling salesman theorem on 1-rectifiability of sets holds for any Carnot…
In the last three decades, powerful computer-assisted techniques have been developed in order to validate a posteriori numerical solutions of semilinear elliptic problems of the form $\Delta u +f(u,\nabla u) = 0$. By studying a well chosen…