• Publications
  • Influence
Automatic Sequences - Theory, Applications, Generalizations
Preface 1. Stringology 2. Number theory and algebra 3. Numeration systems 4. Finite automata and other models of computation 5. Automatic sequences 6. Uniform morphisms and automatic sequences 7. Morphic sequences 8. Frequency of letters 9. Characteristic words. Expand
The Ring of k-Regular Sequences
The automatic sequence is the central concept at the intersection of formal language theory and number theory and has been extensively studied by Christol, Kamae, Mendes France and other writers. Expand
The ring of k-regular sequences, II
In this paper, we continue our study of k-regular sequences begun in 1992. Expand
The Ubiquitous Prouhet-Thue-Morse Sequence
We discuss a well-known binary sequence called the Prouhet-Thue-Morse sequence. Expand
A Second Course in Formal Languages and Automata Theory
A Second Course in Formal Languages and Automata Theory treats topics in the theory of computation not usually covered in a first course. Expand
Regular Expressions: New Results and Open Problems
We define what it means for a regular expression to be collapsible if any of the following conditions hold: 1. Expand
Algorithmic Number Theory
  • E. Bach, J. Shallit
  • Mathematics, Computer Science
  • Lecture Notes in Computer Science
  • 1 September 1996
Simple continued fractions for some irrational numbers, II
Abstract In this paper we prove a theorem allowing us to determine the continued fraction expansion for Σ k =0 ∞ u − c ( k ) , where c ( k ) is any sequence of positive integers that growsExpand