Computable symbolic dynamics

DOI10.1002/MALQ.200710066MaRDI QIDQ3528142zbMATH OpenOpenAlexFDO

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

Publication date 8 October 2008

Published in Mathematical Logic Quarterly (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/malq.200710066

zbMATH Keywords

computabilitycomputable closed setssymbolic dynamics

Mathematics Subject Classification ID

Applications of computability and recursion theory (03D80) Constructive and recursive analysis (03F60) Constructive real analysis (26E40) Symbolic dynamics (37B10)

Recommendations

• Effective symbolic dynamics
• scientific article; zbMATH DE number 5117086
• Computability of countable subshifts
• Computability of countable subshifts in one dimension
• On the computability of the topological entropy of subshifts

Cites work

• An Introduction to Symbolic Dynamics and Coding
• Computing over the reals: foundations for scientific computing.
• Effectively closed sets and enumerations
• Effectively closed sets and graphs of computable real functions.
• Grammatical Complexity and One-Dimensional Dynamical Systems
• scientific article; zbMATH DE number 5117086 (Why is no real title available?)
• scientific article; zbMATH DE number 3811868 (Why is no real title available?)
• scientific article; zbMATH DE number 4039896 (Why is no real title available?)
• scientific article; zbMATH DE number 3718210 (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 1390012 (Why is no real title available?)
• scientific article; zbMATH DE number 3110188 (Why is no real title available?)
• On finite limit sets for transformations on the unit interval
• On the definitions of computable real continuous functions
• The computational complexity of some Julia sets

Cited in

(28)

• On the computational complexity of the languages of general symbolic dynamical systems and beta-shifts
• Symbolic dynamics and characterization of complexity
• Finitely presented expansions of computably enumerable semigroups
• Turing degree spectra of minimal subshifts
• \it \Pi^0_1 Sets and Tilings
• Symbolic Dynamics, Flower Automata and Infinite Traces
• Computability in Symbolic Dynamics
• scientific article; zbMATH DE number 5117086 (Why is no real title available?)
• Conservatively approximable functions
• Symbolic dynamics and finite automata
• Computability of countable subshifts
• Turing degrees of multidimensional SFTs
• scientific article; zbMATH DE number 23664 (Why is no real title available?)
• Cototal enumeration degrees and their applications to effective mathematics
• About the domino problem for subshifts on groups
• Dynamics and computation in functional shifts
• scientific article; zbMATH DE number 852189 (Why is no real title available?)
• Effective symbolic dynamics
• SYMBOLIC DYNAMICS GENERATED BY A COMBINATION OF GRAPHS
• Finitely presented expansions of groups, semigroups, and algebras
• Medvedev degrees of two-dimensional subshifts of finite type
• FROM SYMBOLIC DYNAMICS TO A DIGITAL APPROACH
• Mathematical Foundations of Computer Science 2005
• scientific article; zbMATH DE number 970131 (Why is no real title available?)
• Dynamical aspects of \(\sigma\)-machines
• Computability of countable subshifts in one dimension
• Effective dynamical systems beyond dimension zero and factors of SFTs
• Computability and the morphological complexity of some dynamics on continuous domains

This page was built for publication: Computable symbolic dynamics

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