Decidability and Enumeration for Automatic Sequences: A Survey
From MaRDI portal
Publication:4928472
DOI10.1007/978-3-642-38536-0_5zbMath1381.68238OpenAlexW2170520051MaRDI QIDQ4928472
Publication date: 14 June 2013
Published in: Computer Science – Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-38536-0_5
Related Items (10)
Abelian-square-rich words ⋮ Mechanical Proofs of Properties of the Tribonacci Word ⋮ Closed, palindromic, rich, privileged, trapezoidal, and balanced words in automatic sequences ⋮ Decision algorithms for Fibonacci-automatic Words, I: Basic results ⋮ Effective S-adic Symbolic Dynamical Systems ⋮ First-Order Logic and Numeration Systems ⋮ Ostrowski-automatic sequences: theory and applications ⋮ Some properties of a Rudin-Shapiro-like sequence ⋮ Additive number theory via automata theory ⋮ Complexity of automatic sequences
This page was built for publication: Decidability and Enumeration for Automatic Sequences: A Survey