The ring of k-regular sequences, II

Authors:
Jean-Paul Allouche;Jeffrey Shallit
Affiliations:
CNRS, Laboratoire de Recherche en Informatique, Centre d'Orsay, Univ. Paris-Sud (Paris XI) Bâtiment 490, F-91405 Orsay Cedex, France;Department of Computer Science, University of Waterloo, Waterloo, Ont., Canada N2L 3G1
Venue:
Theoretical Computer Science - WORDS
Year:
2003

Citing 8
Cited 4

Challenging mathematical problems with elementary solutions

Challenging mathematical problems with elementary solutions
The ring of k-regular sequences

Theoretical Computer Science
Exact solution of a minimal recurrence

Information Processing Letters
Automata, Languages, and Machines

Automata, Languages, and Machines
Concrete Math

Concrete Math
Palindrome complexity

Theoretical Computer Science
Counting Overlap-Free Binary Words

STACS '93 Proceedings of the 10th Annual Symposium on Theoretical Aspects of Computer Science
Automatic Sequences: Theory, Applications, Generalizations

Automatic Sequences: Theory, Applications, Generalizations

On some questions regarding k -regular and k -context-free sequences

Theoretical Computer Science
On factors of synchronized sequences

Theoretical Computer Science
Enumeration and decidable properties of automatic sequences

DLT'11 Proceedings of the 15th international conference on Developments in language theory
On the complexity of a family of k-context-free sequences

Theoretical Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we continue our study of k-regular sequences begun in 1992. We prove some new results, give many new examples from the literature, and state some open problems.