Enumeration and decidable properties of automatic sequences

DOI10.1007/978-3-642-22321-1_15MaRDI QIDQ5199962zbMATH OpenOpenAlexFDO

Authors Émilie Charlier, Narad Rampersad, Jeffrey Shallit

Publication date 29 July 2011

Published in Developments in Language Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-22321-1_15

Mathematics Subject Classification ID

Automata and formal grammars in connection with logical questions (03D05) Automata sequences (11B85) Formal languages and automata (68Q45)

Recommendations

• Enumeration and decidable properties of automatic sequences
• The ring of k-regular sequences
• Enumeration and automatic sequences
• Decidability and Enumeration for Automatic Sequences: A Survey
• Periodicity, repetitions, and orbits of an automatic sequence

Cited in

(24)

• Automatic sequences based on Parry or Bertrand numeration systems
• Decidability and \(k\)-regular sequences
• Ostrowski-automatic sequences: theory and applications
• Quasi-universal \(k\)-regular sequences
• Periodicity, repetitions, and orbits of an automatic sequence
• Iterated pushdown automata and sequences of rational numbers
• Closed, palindromic, rich, privileged, trapezoidal, and balanced words in automatic sequences
• On automatic infinite permutations
• Automatic Theorem-Proving in Combinatorics on Words
• Enumeration and automatic sequences
• Automatic sequences and zip-specifications
• Sequences of Level 1, 2, 3,..., k,...
• scientific article; zbMATH DE number 3918355 (Why is no real title available?)
• scientific article; zbMATH DE number 3933047 (Why is no real title available?)
• scientific article; zbMATH DE number 3948238 (Why is no real title available?)
• scientific article; zbMATH DE number 1916667 (Why is no real title available?)
• Enumeration and decidable properties of automatic sequences
• On the number of unbordered factors
• Decidability and Enumeration for Automatic Sequences: A Survey
• Abelian complexity and synchronization
• Automatic sequences of rank two
• On disjunctivity, ultimate periodicity and ultimate identity of Păun-Salomaa self-reading sequences
• Decimation-invariant sequences and their automaticity
• A note on the Lie complexity and beyond

This page was built for publication: Enumeration and decidable properties of automatic sequences

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