Related papers: Real numbers having ultimately periodic representa…
Generalizations of linear numeration systems in which the set of natural numbers is recognizable by finite automata are obtained by describing an arbitrary infinite regular language following the lexicographic ordering. For these systems of…
We show how to represent an interval of real numbers in an abstract numeration system built on a language that is not necessarily regular. As an application, we consider representations of real numbers using the Dyck language. We also show…
In the present article, real number representations, that are generalizations of classical positive and alternating representations of numbers, are introduced and investigated. The main metric relation, properties of cylinder sets are…
Abstract numeration systems encode natural numbers using radix ordered words of an infinite regular language and linear recurrence sequences play a key role in their valuation. Sequence automata, which are deterministic finite automata with…
Generalizations of numeration systems in which N is recognizable by a finite automaton are obtained by describing a lexicographically ordered infinite regular language L over a finite alphabet A. For these systems, we obtain a…
We study periodic expansions in positional number systems with a base $\beta\in\C,\ |\beta|>1$, and with coefficients in a finite set of digits $\A\subset\C.$ We are interested in determining those algebraic bases for which there exists…
Let L be an infinite regular language on a totally ordered alphabet (A,<). Feeding a finite deterministic automaton (with output) with the words of L enumerated lexicographically with respect to < leads to an infinite sequence over the…
In the present article, we introduce beta-expansions in the ring $\mathbb{Z}_p$ of $p$-adic integers. We characterise the sets of numbers with eventually periodic and finite expansions.
In this paper we revisit the regular-language representation of game semantics of second-order recursion free Idealized Algol with infinite data types. By using symbolic values instead of concrete ones we generalize the standard notion of…
Formal languages are sets of strings of symbols described by a set of rules specific to them. In this note, we discuss a certain class of formal languages, called regular languages, and put forward some elementary results. The properties of…
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…
The article is devoted to introduce and investigation of new numeral systems. These representations are generalizations of classical representations of real numbers. The main properties of investigating representations are described. The…
In this paper we study representations of real numbers in a numeral system with the base $a>1$ and alphabet (digits set) $A\equiv\{0,1,...,r\}$, $a-1<r\in N$ given by \[x=\sum\limits_{n=1}^{\infty}\frac{\alpha_n}{a^n}\equiv…
I propose a class of non-positional numeral systems where numbers are represented by Dyck words, with the systems arising from a recursive extension of prime factorization. After describing two proper subsets of the Dyck language capable of…
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…
We address the following decision problem. Given a numeration system $U$ and a $U$-recognizable set $X\subseteq\mathbb{N}$, i.e. the set of its greedy $U$-representations is recognized by a finite automaton, decide whether or not $X$ is…
The notion of almost periodicity nontrivially generalizes the notion of periodicity. Strongly almost periodic sequences (=uniformly recurrent infinite words) first appeared in the field of symbolic dynamics, but then turned out to be…
In this expository article, the real numbers are defined as infinite decimals. After defining an ordering relation and the arithmetic operations, it is shown that the set of real numbers is a complete ordered field. It is further shown that…
This work builds on the notion of breadth-first signature of infinite trees and (prefix-closed) languages introduced by the authors in a previous work. We focus here on periodic signatures, a case coming from the study of rational base…
In this paper, we consider representations of integers as sums of generalized heptagonal numbers with a prescribed number of repeats of each heptagonal number appearing in the sum. In particular, we investigate the classification of such…