On univoque Pisot numbers

We study Pisot numbers $\beta \in (1, 2)$ which are univoque, i.e., such that there exists only one representation of 1 as $1 = \sum_{n \geq 1} s_n\beta^{-n}$, with $s_n \in \{0, 1\}$. We prove in particular that there exists a smallest univoque Pisot number, which has degree 14. Furthermore we give the smallest limit point of the set of univoque Pisot numbers.Comment: Accepted by Mathematics of COmputatio

Ultimate periodicity of b-recognisable sets : a quasilinear procedure

It is decidable if a set of numbers, whose representation in a base b is a regular language, is ultimately periodic. This was established by Honkala in 1986. We give here a structural description of minimal automata that accept an ultimately periodic set of numbers. We then show that it can verified in linear time if a given minimal automaton meets this description. This thus yields a O(n log(n)) procedure for deciding whether a general deterministic automaton accepts an ultimately periodic set of numbers.Comment: presented at DLT 201

The monoid of queue actions

We investigate the monoid of transformations that are induced by sequences of writing to and reading from a queue storage. We describe this monoid by means of a confluent and terminating semi-Thue system and study some of its basic algebraic properties, e.g., conjugacy. Moreover, we show that while several properties concerning its rational subsets are undecidable, their uniform membership problem is NL-complete. Furthermore, we present an algebraic characterization of this monoid's recognizable subsets. Finally, we prove that it is not Thurston-automatic

Linearly bounded infinite graphs

Linearly bounded Turing machines have been mainly studied as acceptors for context-sensitive languages. We define a natural class of infinite automata representing their observable computational behavior, called linearly bounded graphs. These automata naturally accept the same languages as the linearly bounded machines defining them. We present some of their structural properties as well as alternative characterizations in terms of rewriting systems and context-sensitive transductions. Finally, we compare these graphs to rational graphs, which are another class of automata accepting the context-sensitive languages, and prove that in the bounded-degree case, rational graphs are a strict sub-class of linearly bounded graphs

Digital expansions with negative real bases

Similarly to Parry's characterization of $\beta$-expansions of real numbers in real bases $\beta > 1$, Ito and Sadahiro characterized digital expansions in negative bases, by the expansions of the endpoints of the fundamental interval. Parry also described the possible expansions of 1 in base $\beta > 1$. In the same vein, we characterize the sequences that occur as $(-\beta)$-expansion of $\frac{-\beta}{\beta+1}$ for some $\beta > 1$. These sequences also describe the itineraries of 1 by linear mod one transformations with negative slope

Synchronizing Relations on Words

While the theory of languages of words is very mature, our understanding of relations on words is still lagging behind. And yet such relations appear in many new applications such as verification of parameterized systems, querying graph-structured data, and information extraction, for instance. Classes of well-behaved relations typically used in such applications are obtained by adapting some of the equivalent definitions of regularity of words for relations, leading to non-equivalent notions of recognizable, regular, and rational relations. The goal of this paper is to propose a systematic way of defining classes of relations on words, of which these three classes are just natural examples, and to demonstrate its advantages compared to some of the standard techniques for studying word relations. The key idea is that of a synchronization of a pair of words, which is a word over an extended alphabet. Using it, we define classes of relations via classes of regular languages over a fixed alphabet, just {1,2} for binary relations. We characterize some of the standard classes of relations on words via finiteness of parameters of synchronization languages, called shift, lag, and shiftlag. We describe these conditions in terms of the structure of cycles of graphs underlying automata, thereby showing their decidability. We show that for these classes there exist canonical synchronization languages, and every class of relations can be effectively re-synchronized using those canonical representatives. We also give sufficient conditions on synchronization languages, defined in terms of injectivity and surjectivity of their Parikh images, that guarantee closure under intersection and complement of the classes of relations they define

\Lambda

Abstract For irrational fi? 1 we consider the set Fin(fi) of real numbers for which jxj has a finite number of non-zero digits in its expansion in base fi. In particular, we consider the set of fi-integers, i.e. numbers whose fi-expansion is of the form

The relationship between strategies of self-protection and self-improvement in the management of self-knowledge

SIGLEAvailable from British Library Document Supply Centre-DSC:DXN006976 / BLDSC - British Library Document Supply CentreGBUnited Kingdo

Sturmian graphs and integer representations over numeration systems

AbstractIn this paper we consider a numeration system, originally due to Ostrowski, based on the continued fraction expansion of a real number α. We prove that this system has deep connections with the Sturmian graph associated with α. We provide several properties of the representations of the natural integers in this system. In particular, we prove that the set of lazy representations of the natural integers in this numeration system is regular if and only if the continued fraction expansion of α is eventually periodic. The main result of the paper is that for any number i the unique path weighted i in the Sturmian graph associated with α represents the lazy representation of i in the Ostrowski numeration system associated with α