On Some Questions Regarding K-Regular And K-Context-Free Sequences
THEORETICAL COMPUTER SCIENCE（2008）
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. (c) 2008 Elsevier B. V. All rights reserved.
MoreTranslated text
Key words
automatic sequences,regular sequences,context-free sequences,subword complexity
AI Read Science
Must-Reading Tree
Example
Generate MRT to find the research sequence of this paper
Chat Paper
Summary is being generated by the instructions you defined