On some questions regarding \(k\)-regular and \(k\)-context-free sequences

DOI10.1016/j.tcs.2008.02.018zbMath1143.68038OpenAlexW2076570757MaRDI QIDQ930914

Yossi Moshe

Publication date: 24 June 2008

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2008.02.018

zbMATH Keywords

automatic sequencessubword complexityregular sequencescontext-free sequences

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Automata sequences (11B85)

Related Items (8)

Morphisms on infinite alphabets, countable states automata and regular sequences ⋮ When is an automatic set an additive basis? ⋮ On the regularity of \(\{\lfloor \log_b(\alpha n+\beta)\rfloor\}_{n\geq 0}\) ⋮ Some Applications of Algebra to Automatic Sequences ⋮ A Final Coalgebra for k-regular Sequences ⋮ On the computational complexity of algebraic numbers: the Hartmanis–Stearns problem revisited ⋮ Automatic Sequences and Generalised Polynomials ⋮ On the complexity of a family of \(k\)-context-free sequences

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Substitution dynamical systems - spectral analysis
• The ring of \(k\)-regular sequences
• Ensembles presque périodiques \(k\)-reconnaissables. (Almost periodic \(k\)-recognizable sets)
• Pascal's triangle, complexity and automata
• Transcendence of formal power series with rational coefficients
• The ring of \(k\)-regular sequences. II.
• Suites algébriques, automates et substitutions
• Automatic Sequences
• Finite automata and morphisms in assisted musical composition*

This page was built for publication: On some questions regarding \(k\)-regular and \(k\)-context-free sequences