Beta-shifts, their languages, and computability

DOI10.1007/s00224-009-9245-zzbMath1217.03029OpenAlexW2159020094MaRDI QIDQ633763

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

computability theorycomputable real numbercomputable analysissymbolic dynamical system

Mathematics Subject Classification ID

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

Related Items

Computability of topological pressure on compact shift spaces beyond finite type*, Beta-shifts, their languages, and computability

Cites Work

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