Context-free sequences

DOI10.1007/978-3-319-10882-7_16MaRDI QIDQ2938167zbMATH OpenOpenAlexFDO

Authors Marion Le Gonidec, Didier Caucal

Publication date 13 January 2015

Published in Theoretical Aspects of Computing – ICTAC 2014 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-10882-7_16

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• On the complexity of a family of \(k\)-context-free sequences
• A result about languages concerning paperfolding sequences
• Generalization of automatic sequences for numeration systems on a regular language
• scientific article; zbMATH DE number 1916667
• Automatic sequences

Cited in

(7)

• Sequences of Level 1, 2, 3,..., k,...
• RECURRENT DOUBLE SEQUENCES THAT CAN BE PRODUCED BY CONTEXT-FREE SUBSTITUTIONS
• A result about languages concerning paperfolding sequences
• scientific article; zbMATH DE number 4128397 (Why is no real title available?)
• On the computational complexity of algebraic numbers: the Hartmanis-Stearns problem revisited
• The structure of trees in the pushdown hierarchy
• Tree representations of infinite words and their logical properties

This page was built for publication: Context-free sequences

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2938167)