Share This Author
Automatic Sequences - Theory, Applications, Generalizations
This chapter discusses automata, automatic sequences, and other models of computation in number theory and algebra, as well as number systems and numeration systems, and some examples of these models are presented.
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 Rauzy, and other writers.
Automatic Sequences: Frequency of Letters
The ring of k-regular sequences, II
The Ubiquitous Prouhet-Thue-Morse Sequence
The Prouhet-Thue-Morse sequence appears to be somewhat ubiquitous, and it is described many of its apparently unrelated occurrences.
A Second Course in Formal Languages and Automata Theory
- J. Shallit
- Computer Science
- 8 September 2008
Many topics often absent from other textbooks, such as repetitions in words, state complexity, the interchange lemma, 2DPDAs, and the incompressibility method are covered here.
Regular Expressions: New Results and Open Problems
Regular expressions have been studied for nearly 50 years, yet many intriguing problems about their descriptive capabilities remain open and some new results are sketches.
Algorithmic Number Theory