Beta-shifts, their languages, and computability

DOI10.1007/S00224-009-9245-ZzbMATH Open1217.03029OpenAlexW2159020094MaRDI QIDQ633763FDOQ633763

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

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

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)

Cites Work

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

Cited In (3)

• Computability of topological pressure on compact shift spaces beyond finite type*
• Beta-shifts, their languages, and computability
• 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)