Effective symbolic dynamics

DOI10.1016/J.ENTCS.2008.03.010MaRDI QIDQ4918032zbMATH OpenOpenAlexFDO

Authors Douglas Cenzer, S. Ali Dashti, Jonathan L. King

Publication date 3 May 2013

Published in Electronic Notes in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.entcs.2008.03.010

zbMATH Keywords

\(\Pi_1^0\) classescomputabilitysymbolic dynamics

Mathematics Subject Classification ID

Theory of numerations, effectively presented structures (03D45) Computation over the reals, computable analysis (03D78) Symbolic dynamics (37B10)

Recommendations

• Computable symbolic dynamics
• On the dynamics and recursive properties of multidimensional symbolic systems
• scientific article; zbMATH DE number 5117086
• Computability of countable subshifts
• On the computability of the topological entropy of subshifts

Cites work

• An Introduction to Symbolic Dynamics and Coding
• Effectively closed sets and enumerations
• Grammatical Complexity and One-Dimensional Dynamical Systems
• scientific article; zbMATH DE number 5117086 (Why is no real title available?)
• scientific article; zbMATH DE number 4039896 (Why is no real title available?)
• scientific article; zbMATH DE number 52121 (Why is no real title available?)
• scientific article; zbMATH DE number 1303200 (Why is no real title available?)
• scientific article; zbMATH DE number 1460545 (Why is no real title available?)
• scientific article; zbMATH DE number 749920 (Why is no real title available?)
• scientific article; zbMATH DE number 3110188 (Why is no real title available?)
• Non-computable Julia sets
• On finite limit sets for transformations on the unit interval
• On the abundance of aperiodic behaviour for maps on the interval
• On the computability of fractal dimensions and Hausdorff measure
• On the definitions of computable real continuous functions
• The computational complexity of some Julia sets

Cited in

(9)

• On the computational complexity of the languages of general symbolic dynamical systems and beta-shifts
• Decimation and interleaving operations in one-sided symbolic dynamics
• \it \Pi^0_1 Sets and Tilings
• Computability in Symbolic Dynamics
• Computable symbolic dynamics
• Computability of countable subshifts
• Turing degrees of multidimensional SFTs
• Dynamics and computation in functional shifts
• Two notes on subshifts

This page was built for publication: Effective symbolic dynamics

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