Decidability and Enumeration for Automatic Sequences: A Survey
From MaRDI portal
(Redirected from Publication:4928472)
Recommendations
- Enumeration and decidable properties of automatic sequences
- Enumeration and decidable properties of automatic sequences
- A generalization of automatic sequences
- Decidability and \(k\)-regular sequences
- Automatic Sequences
- Complexity of automatic sequences
- Complexity of automatic sequences
- On the \(N\)th linear complexity of automatic sequences
- Automatic Decidability and Combinability Revisited
- scientific article; zbMATH DE number 1001512
Cited in
(17)- Additive number theory via automata theory
- Ostrowski-automatic sequences: theory and applications
- Abelian-square-rich words
- 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
- Mechanical proofs of properties of the Tribonacci word
- 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?)
- First-order logic and numeration systems
- Some properties of a Rudin-Shapiro-like sequence
- Enumeration and decidable properties of automatic sequences
- A case study in meta-automation: automatic generation of congruence automata for combinatorial sequences
- Enumeration and decidable properties of automatic sequences
- Complexity of automatic sequences
- Enumerating \(m\)-length walks in directed graphs with constant delay
This page was built for publication: Decidability and Enumeration for Automatic Sequences: A Survey
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4928472)
