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

Authors:
Yossi Moshe
Affiliations:
CNRS, LRI, Université Paris Sud, Orsay, France
Venue:
Theoretical Computer Science
Year:
2008

Citing 6
Cited 1

Fractals, bitmaps, and APL

ACM SIGAPL APL Quote Quad
The ring of k-regular sequences

Theoretical Computer Science
Transcendence of formal power series with rational coefficients

Theoretical Computer Science
Automatic Sequences: Theory, Applications, Generalizations

Automatic Sequences: Theory, Applications, Generalizations
The ring of k-regular sequences, II

Theoretical Computer Science - WORDS
Introduction to Automata Theory, Languages, and Computation (3rd Edition)

Introduction to Automata Theory, Languages, and Computation (3rd Edition)

On the complexity of a family of k-context-free sequences

Theoretical Computer Science

Quantified Score

Hi-index	5.23

Visualization

Abstract

We answer two questions of Allouche and Shallit regarding k-regular sequences and k-context-free sequences. One of these has been solved independently in another way by Bell. We also provide a partial solution to another question of Allouche and Shallit regarding the subword complexity of k-context-free sequences.