Beta-shifts, their languages, and computability

DOI10.1007/S00224-009-9245-ZMaRDI QIDQ633763zbMATH OpenOpenAlexFDO

Authors Jakob Grue Simonsen

Publication date 30 March 2011

Published in Theory of Computing Systems (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00224-009-9245-z

zbMATH Keywords

computable analysissymbolic dynamical systemcomputability theorycomputable real number

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Computation over the reals, computable analysis (03D78) Combinatorics on words (68R15)

Recommendations

• Mathematical Foundations of Computer Science 2005
• On the computational complexity of the languages of general symbolic dynamical systems and beta-shifts
• Allowed patterns of \(\beta \)-shifts
• Shifts with decidable language and non-computable entropy
• Permutations and \(\beta \)-shifts

Cites work

• scientific article; zbMATH DE number 425393 (Why is no real title available?)
• scientific article; zbMATH DE number 4002093 (Why is no real title available?)
• scientific article; zbMATH DE number 4070894 (Why is no real title available?)
• scientific article; zbMATH DE number 3745547 (Why is no real title available?)
• scientific article; zbMATH DE number 1339873 (Why is no real title available?)
• scientific article; zbMATH DE number 1010621 (Why is no real title available?)
• scientific article; zbMATH DE number 2070336 (Why is no real title available?)
• scientific article; zbMATH DE number 1460545 (Why is no real title available?)
• scientific article; zbMATH DE number 1789350 (Why is no real title available?)
• A characterization of the entropies of multidimensional shifts of finite type
• Additive and multiplicative properties of point sets based on beta-integers.
• Almost Every Number Has a Continuum of b-Expansions
• An Introduction to Symbolic Dynamics and Coding
• Beta-shifts, their languages, and computability
• Classical recursion theory. The theory of functions and sets of natural numbers
• Computability in linear algebra
• Computability theoretic properties of the entropy of gap shifts
• Dynamics forβ-shifts and Diophantine approximation
• Finite beta-expansions
• Markov subshifts and realization of \(\beta\)-expansions
• Mathematical Foundations of Computer Science 2005
• Mathematical Foundations of Computer Science 2005
• Measures of maximal entropy for random \(\beta\)-expansions
• Nicht konstruktiv beweisbare Sätze der Analysis
• On Computable Numbers, with an Application to the Entscheidungsproblem
• On Computable Numbers, with an Application to the Entscheidungsproblem. A Correction
• On Periodic Expansions of Pisot Numbers and Salem Numbers
• On the computability of the topological entropy of subshifts
• On the computational complexity of the languages of general symbolic dynamical systems and beta-shifts
• On theβ-expansions of real numbers
• Representations for real numbers and their ergodic properties
• Shift with orbit basis and realization of one dimensional maps
• The Arithmetical Hierarchy of Real Numbers
• The entropies of topological Markov shifts and a related class of algebraic integers
• \(\beta\)-expansions and symbolic dynamics
• \(\beta\)-shifts have unique maximal measure

Cited in

(6)

• On the computational complexity of the languages of general symbolic dynamical systems and beta-shifts
• Allowed patterns of \(\beta \)-shifts
• Computability of topological pressure on compact shift spaces beyond finite type*
• Beta-shifts, their languages, and computability
• Mathematical Foundations of Computer Science 2005
• Quasi-periodic \(\beta\)-expansions and cut languages

This page was built for publication: Beta-shifts, their languages, and computability

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