Results 1  10
of
13
Extensions and restrictions of Wythoff’s game preserving its P positions
 Journal of Combinatorial Theory, Series A
"... Abstract. We consider extensions and restrictions of Wythoff’s game having exactly the same set of P positions as the original game. No strict subset of rules give the same set of P positions. On the other hand, we characterize all moves that can be adjoined while preserving the original set of P po ..."
Abstract

Cited by 20 (8 self)
 Add to MetaCart
(Show Context)
Abstract. We consider extensions and restrictions of Wythoff’s game having exactly the same set of P positions as the original game. No strict subset of rules give the same set of P positions. On the other hand, we characterize all moves that can be adjoined while preserving the original set of P positions. Testing if a move belongs to such an extended set of rules is shown to be doable in polynomial time. Many arguments rely on the infinite Fibonacci word, automatic sequences and the corresponding number system. With these tools, we provide new twodimensional morphisms generating an infinite picture encoding respectively P positions of Wythoff’s game and moves that can be adjoined. 1.
On the cost and complexity of the successor function
 IN PROC. WORDS 2007
, 2009
"... For a given numeration system, the successor function maps the representation of an integer n onto the representation of its successor n+1. In a general setting, the successor function maps the nth word of a genealogically ordered language L onto the (n+1)th word of L. We show that, if the ratio ..."
Abstract

Cited by 7 (3 self)
 Add to MetaCart
(Show Context)
For a given numeration system, the successor function maps the representation of an integer n onto the representation of its successor n+1. In a general setting, the successor function maps the nth word of a genealogically ordered language L onto the (n+1)th word of L. We show that, if the ratio of the number of elements of length n +1overthenumber of elements of length n of the language has a limit β>1, then the amortized cost of the successor function is equal to β/(β − 1). From this, we deduce the value of the amortized cost for several classes of numeration systems (integer base systems, canonical numeration systems associated with a Parry number, abstract numeration systems built on a rational language, and rational base numeration systems).
A DECISION PROBLEM FOR ULTIMATELY PERIODIC SETS IN NONSTANDARD NUMERATION SYSTEMS
"... Abstract. Consider a nonstandard 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 their greedy representations in this system is accepted by ..."
Abstract

Cited by 6 (2 self)
 Add to MetaCart
(Show Context)
Abstract. Consider a nonstandard 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 their greedy representations in this system is accepted by a finite automaton, we consider the problem of deciding whether or not X is a finite union of arithmetic progressions. We obtain a decision procedure for this problem, under some hypothesis about the considered numeration system. In a second part, we obtain an analogous decision result for a particular class of abstract numeration systems built on an infinite regular language. 1.
OnLine Odometers for TwoSided Symbolic Dynamical Systems
"... We consider biin nite sequences on a nite alphabet of digits which satisfy a constraint of nite type. Such sequences are perturbed by adding a 1 in position 0. The odometer is the function which transforms the initial sequence into an admissible sequence equivalent to the perturbed one. It is ..."
Abstract

Cited by 4 (0 self)
 Add to MetaCart
We consider biin nite sequences on a nite alphabet of digits which satisfy a constraint of nite type. Such sequences are perturbed by adding a 1 in position 0. The odometer is the function which transforms the initial sequence into an admissible sequence equivalent to the perturbed one. It is shown that the odometer can be realized by an online nite automaton when the constraint is linked to numeration in base , where is a Pisot number satisfying the equation = t1 + +tm , where t1 t2 tm 1 are integers.
Odometers on regular languages
 Objective 8: Prevent the invasion of the zebra mussel into California. Goal 6: Water and Sediment Quality Improve
"... Abstract. Odometers or “adding machines ” are usually introduced in the context of positional numeration systems built on a strictly increasing sequence of integers. We generalize this notion to systems defined on an arbitrary infinite regular language. In this latter situation, if (A, <) is a to ..."
Abstract

Cited by 2 (2 self)
 Add to MetaCart
(Show Context)
Abstract. Odometers or “adding machines ” are usually introduced in the context of positional numeration systems built on a strictly increasing sequence of integers. We generalize this notion to systems defined on an arbitrary infinite regular language. In this latter situation, if (A, <) is a totally ordered alphabet, then enumerating the words of a regular language L over A with respect to the induced genealogical ordering gives a onetoone correspondence between N and L. In this general setting, the odometer is not defined on a set of sequences of digits but on a set of pairs of sequences where the first (resp. the second) component of the pair is an infinite word over A (resp. an infinite sequence of states of the minimal automaton of L). We study some properties of the odometer like continuity, injectivity, surjectivity, minimality,... We then study some particular cases: we show the equivalence of this new function with the classical odometer built upon a sequence of integers whenever the set of greedy representations of all the integers is a regular language; we also consider substitution numeration systems as well as the connection with βnumerations. 1.
Radix enumeration of rational languages is almost cosequential
, 2008
"... We define and study here the class of rational functions that are finite union of sequential functions. These functions can be realized by cascades of sequential transducers. After showing that cascades of any height are equivalent to cascades of height at most two and that this class strictly conta ..."
Abstract
 Add to MetaCart
(Show Context)
We define and study here the class of rational functions that are finite union of sequential functions. These functions can be realized by cascades of sequential transducers. After showing that cascades of any height are equivalent to cascades of height at most two and that this class strictly contains sequential functions and is strictly contained in the class of rational functions, we prove the result whose statement gives the paper its title.