## Numeration systems, linear recurrences, and regular sets (1994)

Venue: | Inform. and Comput |

Citations: | 35 - 4 self |

### BibTeX

@ARTICLE{Shallit94numerationsystems,,

author = {Jeffrey Shallit},

title = {Numeration systems, linear recurrences, and regular sets},

journal = {Inform. and Comput},

year = {1994},

volume = {113},

pages = {331--347}

}

### Years of Citing Articles

### OpenURL

### Abstract

A numeration system based on a strictly increasing sequence of positive integers u0 = 1, u1, u2,... expresses a non-negative integer n as a sum n = � i j=0 ajuj. In this case we say the string aiai−1 · · · a1a0 is a representation for n. If gcd(u0, u1,...) = g, then every sufficiently large multiple of g has some representation. If the lexicographic ordering on the representations is the same as the usual ordering of the integers, we say the numeration system is order-preserving. In particular, if u0 = 1, then the greedy representation, obtained via the greedy algorithm, is orderpreserving. We prove that, subject to some technical assumptions, if the set of all representations in an order-preserving numeration system is regular, then the sequence u = (uj)j≥0 satisfies a linear recurrence. The converse, however, is not true. The proof uses two lemmas about regular sets that may be of independent interest. The first shows that if L is regular, then the set of lexicographically greatest strings of every length in L is also regular. The second shows that the number of strings of length n in a regular language L is bounded by a constant (independent of n) iff L is the finite union of sets of the form xy ∗ z. 1

### Citations

3836 |
J.D.: Introduction to automata theory, languages, and computation
- Hopcroft, Motwani, et al.
(Show Context)
Citation Context ...o (Σ ∗ − (L − B(L))) ∩ L = B(L). But regular sets are closed under complement and intersection, and so B(L) is regular. Let M = (Q, Σ, δ, q0, F ) be a deterministic finite automaton accepting L. (See =-=[23]-=- for the basic notions about automata and the notational conventions that we use here.) The idea is to accept L − B(L) with a nondeterministic finite automaton. We use two “fingers” to mimic the behav... |

617 | Combinatorics on Words - Lothaire - 1997 |

234 | Adherences of languages
- Boasson, Nivat
- 1980
(Show Context)
Citation Context ...is ordering, called “radix order” by Berstel [1, p. 76] is a well-order (i.e. each nonempty set has a least element), and it differs from the lexicographic order defined by other authors [26, p. 64]; =-=[1]-=-. It is, however, the natural order for our problem. 2sto be ɛ, the empty string. The set of greedy representations for all greedily representable integers is written G(u). It is easy to see that ever... |

97 |
Automatic Sequences
- Allouche, Shallit
- 2003
(Show Context)
Citation Context ...ndent interest. Remarks on the literature. The point of view we will adopt in this paper is similar to that of Frougny, who has written extensively on this topic. See [13, 14, 15, 16, 17, 18, 19]. In =-=[30]-=-, I proved that the set of greedy representations is regular for the numeration systems with bounded digits considered by Fraenkel [11]. We note several other papers that have examined the relationshi... |

55 |
Systems of numeration
- Fraenkel
- 1985
(Show Context)
Citation Context ...s a partial function, rather than a function. Common examples of numeration systems include radix-k representation (for k an integer ≥ 2), Fibonacci representation, factorial representation, etc. See =-=[11, 12]-=- for surveys on numeration systems. In this paper we consider only linear numeration systems constructed as follows: given a strictly increasing sequence of positive integers u0, u1, u2, . . ., we try... |

55 |
Representation des nombres naturels par une somme de.nombres de Fibonacci ou de nombres de Lucas
- Zeckendorf
- 1972
(Show Context)
Citation Context ... uj = Fj+2, where Fj is the jth Fibonacci number. Then it can be shown that the set of greedy representations G(u) is ɛ + 1(0 + 01) ∗ . (For more on Fibonacci representations, see [25, Ex. 1.2.8.34], =-=[31]-=-, [5], [24], and [2].) Example 3. Let uj = 2 j+1 − 1. Then the set of greedy representations G(u) is (ɛ + 1(0 + 1) ∗ )(ɛ + 20 ∗ ). See the recent paper of Cameron and Wood [4]. Suppose we are given an... |

43 |
Representation of numbers and finite automata
- Frougny
- 1992
(Show Context)
Citation Context ...ular sets, which may be of independent interest. Remarks on the literature. The point of view we will adopt in this paper is similar to that of Frougny, who has written extensively on this topic. See =-=[13, 14, 15, 16, 17, 18, 19]-=-. In [30], I proved that the set of greedy representations is regular for the numeration systems with bounded digits considered by Fraenkel [11]. We note several other papers that have examined the re... |

36 |
Fibonacci codes for synchronization control
- Kautz
- 1965
(Show Context)
Citation Context ... where Fj is the jth Fibonacci number. Then it can be shown that the set of greedy representations G(u) is ɛ + 1(0 + 01) ∗ . (For more on Fibonacci representations, see [25, Ex. 1.2.8.34], [31], [5], =-=[24]-=-, and [2].) Example 3. Let uj = 2 j+1 − 1. Then the set of greedy representations G(u) is (ɛ + 1(0 + 1) ∗ )(ɛ + 20 ∗ ). See the recent paper of Cameron and Wood [4]. Suppose we are given an increasing... |

34 | On a problem of Frobenius - Brauer, Shockley - 1962 |

25 |
Fibonacci Representations," Fibonacci Quarterly
- Carlitz
- 1968
(Show Context)
Citation Context ...Fj+2, where Fj is the jth Fibonacci number. Then it can be shown that the set of greedy representations G(u) is ɛ + 1(0 + 01) ∗ . (For more on Fibonacci representations, see [25, Ex. 1.2.8.34], [31], =-=[5]-=-, [24], and [2].) Example 3. Let uj = 2 j+1 − 1. Then the set of greedy representations G(u) is (ɛ + 1(0 + 1) ∗ )(ɛ + 20 ∗ ). See the recent paper of Cameron and Wood [4]. Suppose we are given an incr... |

24 |
Séries trigonométriques et séries de
- Fatou
- 1906
(Show Context)
Citation Context ... ai is a rational number. Then un satisfies a (possibly different) linear recurrence relation where all the ai are actually integers. Proof. This follows immediately from the following lemma of Fatou =-=[10]-=- (also see [28, Part VIII, Problem 156]): if v(z) is a rational function whose Taylor series has rational integer coeffcients, then v(z) can be written in the form f(z)/g(z), where f and g are polynom... |

13 | Fibonacci representations and finite automata
- Frougny
- 1991
(Show Context)
Citation Context ...ular sets, which may be of independent interest. Remarks on the literature. The point of view we will adopt in this paper is similar to that of Frougny, who has written extensively on this topic. See =-=[13, 14, 15, 16, 17, 18, 19]-=-. In [30], I proved that the set of greedy representations is regular for the numeration systems with bounded digits considered by Fraenkel [11]. We note several other papers that have examined the re... |

8 |
Fibonacci Words - A Survey
- Berstel
- 1986
(Show Context)
Citation Context ...is the jth Fibonacci number. Then it can be shown that the set of greedy representations G(u) is ɛ + 1(0 + 01) ∗ . (For more on Fibonacci representations, see [25, Ex. 1.2.8.34], [31], [5], [24], and =-=[2]-=-.) Example 3. Let uj = 2 j+1 − 1. Then the set of greedy representations G(u) is (ɛ + 1(0 + 1) ∗ )(ɛ + 20 ∗ ). See the recent paper of Cameron and Wood [4]. Suppose we are given an increasing sequence... |

7 | Star-height of certain families of regular events - Cohen |

7 |
A decision method for the recognizability of sets defined by number systems
- Honkala
- 1986
(Show Context)
Citation Context ...for the numeration systems with bounded digits considered by Fraenkel [11]. We note several other papers that have examined the relationship between ways of representing numbers and regular sets. See =-=[20, 27, 7, 8, 21, 22]-=-. However, these papers have adopted a very different point of view. 2 More Notation Throughout this paper, Σ is a finite alphabet, and q, s, t denote regular expressions. The letters v, w, x, y, z de... |

4 | Fundamental Algorithms, Vol. I of The Art of Computer Programming - Knuth - 1973 |

4 |
Some binary partition functions
- Reznick
- 1990
(Show Context)
Citation Context ...ot difficult to show that this r is order-preserving. An example is as follows: Example 4. Let uj = 2j , and consider expressing integers n as n = � 0≤j≤i ajuj with 0 ≤ aj ≤ 2. Then Reznick has shown =-=[29]-=- that the number of such such representations is s(n+1), where s(n) is the Stern function, defined by s(0) = 0; s(1) = 1; s(2n) = s(n); and s(2n+1) = s(n)+s(n+1) for n ≥ 1. Now define r(n) to be the l... |

3 |
The use and usefulness of numeration systems
- Fraenkel
- 1989
(Show Context)
Citation Context ...s a partial function, rather than a function. Common examples of numeration systems include radix-k representation (for k an integer ≥ 2), Fibonacci representation, factorial representation, etc. See =-=[11, 12]-=- for surveys on numeration systems. In this paper we consider only linear numeration systems constructed as follows: given a strictly increasing sequence of positive integers u0, u1, u2, . . ., we try... |

3 |
Linear numeration systems of order two
- Frougny
- 1988
(Show Context)
Citation Context ...ular sets, which may be of independent interest. Remarks on the literature. The point of view we will adopt in this paper is similar to that of Frougny, who has written extensively on this topic. See =-=[13, 14, 15, 16, 17, 18, 19]-=-. In [30], I proved that the set of greedy representations is regular for the numeration systems with bounded digits considered by Fraenkel [11]. We note several other papers that have examined the re... |

2 |
Pm numbers, ambiguity, and regularity
- Cameron, Wood
- 1991
(Show Context)
Citation Context ...see [25, Ex. 1.2.8.34], [31], [5], [24], and [2].) Example 3. Let uj = 2 j+1 − 1. Then the set of greedy representations G(u) is (ɛ + 1(0 + 1) ∗ )(ɛ + 20 ∗ ). See the recent paper of Cameron and Wood =-=[4]-=-. Suppose we are given an increasing sequence of positive integers (uj)j≥0, and suppose there is a constant C such that every non-negative integer n has a representation n = � 0≤j≤i ajuj with 0 ≤ aj ≤... |

2 |
Ambiguity and decision problems concerning number systems
- Salomaa
- 1983
(Show Context)
Citation Context ...for the numeration systems with bounded digits considered by Fraenkel [11]. We note several other papers that have examined the relationship between ways of representing numbers and regular sets. See =-=[20, 27, 7, 8, 21, 22]-=-. However, these papers have adopted a very different point of view. 2 More Notation Throughout this paper, Σ is a finite alphabet, and q, s, t denote regular expressions. The letters v, w, x, y, z de... |

2 |
Linear numeration systems, θ–developments and finite automata
- Frougny
- 1989
(Show Context)
Citation Context |

2 |
Syst`emes de num'eration lin'eaires et automates finis, Th`ese d'Etat
- Frougny
- 1989
(Show Context)
Citation Context |

2 |
Bases and ambiguity of number systems
- Honkala
- 1984
(Show Context)
Citation Context ...for the numeration systems with bounded digits considered by Fraenkel [11]. We note several other papers that have examined the relationship between ways of representing numbers and regular sets. See =-=[20, 27, 7, 8, 21, 22]-=-. However, these papers have adopted a very different point of view. 2 More Notation Throughout this paper, Σ is a finite alphabet, and q, s, t denote regular expressions. The letters v, w, x, y, z de... |

2 |
L codes and number systems
- Maurer, Salomaa, et al.
- 1983
(Show Context)
Citation Context |

1 |
Representations of integers and language theory
- Luca, Restivo
- 1984
(Show Context)
Citation Context |

1 |
Fibonacci numeration systems and rational functions
- Frougny
- 1986
(Show Context)
Citation Context |

1 |
Representation of numbers in non-classical numeration systems
- Frougny
- 1991
(Show Context)
Citation Context |

1 |
Unique representation in number systems and L codes
- Honkala
- 1982
(Show Context)
Citation Context |