Related papers: Negative bases and automata
In this paper we study the distribution of the sequence $(\alpha \zeta^{n})_{n\geq 1}$ mod $1$, where $\alpha,\zeta$ are fixed positive real numbers, with special focus on the accumulation point $0$. For this purpose we introduce…
Given $\beta\in(1,2)$, a $\beta$-expansion of a real $x$ is a power series in base $\beta$ with coefficients 0 and 1 whose sum equals $x$. The aim of this note is to study certain problems related to the universality and combinatorics of…
In the past decades, classical results from algebra, including Hilbert's Basis Theorem, had various applications in formal languages, including a proof of the Ehrenfeucht Conjecture, decidability of HDT0L sequence equivalence, and…
Given $\beta\in(1,2)$ and $x\in[0,\frac{1}{\beta-1}]$, a sequence $(\epsilon_{i})_{i=1}^{\infty}\in\{0,1\}^{\mathbb{N}}$ is called a $\beta$-expansion for $x$ if $$x=\sum_{i=1}^{\infty}\frac{\epsilon_{i}}{\beta^{i}}.$$ In a recent article…
We give sufficient conditions for a shift space $(\Sigma,\sigma)$ to be intrinsically ergodic, along with sufficient conditions for every subshift factor of $\Sigma$ to be intrinsically ergodic. As an application, we show that every…
For a given base $\gamma$ and a digit set ${\mathcal B}$ we consider optimal representations of a number $x$, as defined by Dajani at al. in 2012. For a non-integer negative base $\gamma=-\beta<-1$ and the digit set ${\mathcal…
A simple Parry number is a real number \beta>1 such that the R\'enyi expansion of 1 is finite, of the form d_\beta(1)=t_1...t_m. We study the palindromic structure of infinite aperiodic words u_\beta that are the fixed point of a…
Symbolic Finite Automata and Register Automata are two orthogonal extensions of finite automata motivated by real-world problems where data may have unbounded domains. These automata address a demand for a model over large or infinite…
This paper presents a way of formalising definite descriptions with a binary quantifier $\iota$, where $\iota x[F, G]$ is read as `The $F$ is $G$'. Introduction and elimination rules for $\iota$ in a system of intuitionist negative free…
The synthesis of string transformation programs from input-output examples utilizes various techniques, all based on an inductive bias that comprises a restricted set of basic operators to be combined. A new algorithm, Transduce, is…
We study periodic representations in number systems with an algebraic base $\beta$ (not a rational integer). We show that if $\beta$ has no Galois conjugate on the unit circle, then there exists a finite integer alphabet $\mathcal A$ such…
We describe a class of fractal attractors induced by \beta-shifts. We use a coding by these shifts to show that the systems are mixing with topological entropy log \beta and have an ergodic measure of full entropy. Moreover we determine the…
We study the sets DF({\beta}) of digit frequencies of {\beta}-expansions of numbers in [0,1]. We show that DF({\beta}) is a compact convex set with countably many extreme points which varies continuously with {\beta}; that there is a full…
In the random coefficients binary choice model, a binary variable equals 1 iff an index $X^\top\beta$ is positive.The vectors $X$ and $\beta$ are independent and belong to the sphere $\mathbb{S}^{d-1}$ in $\mathbb{R}^{d}$.We prove lower…
(R-channel) TBA is elaborated to find the effective central charge dependence on the boundary parameters for the massless boundary sine-Gordon model with the coupling constant $(8\pi) /\beta^2 = 1+ \lambda $ with $\lambda$ a positive…
The nested off-diagonal Bethe ansatz method is proposed to diagonalize multi-component integrable models with generic integrable boundaries. As an example, the exact solutions of the su(n)-invariant spin chain model with both periodic and…
We give an algorithm, based on the $\phi$-expansion of Parry, in order to compute the topological entropy of a class of shift spaces. The idea is the solve an inverse problem for the dynamical systems $\beta x+\alpha \mod1$.The first part…
Subzero automata is a class of tree automata whose acceptance condition can express probabilistic constraints. Our main result is that the problem of determining if a subzero automaton accepts some regular tree is decidable.
Let A be a set of integers. For every integer n, let r_{A,2}(n) denote the number of representations of n in the form n = a_1 + a_2, where a_1 and a_2 are in A and a_1 \leq a_2. The function r_{A,2}: Z \to N_0 \cup {\infty} is the…
Elizalde (2011) characterized which permutations can be obtained by ordering consecutive elements in the trajectories of (positive) beta-transformations and beta-shifts. We prove similar results for negative bases beta.