Mathematical Foundations of Computer Science 2005

DOI10.1007/11549345zbMATH Open1156.03335OpenAlexW2494705596MaRDI QIDQ5492906FDOQ5492906

Authors: Jakob Grue Simonsen 

Publication date: 20 October 2006

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11549345

Recommendations

• Beta-shifts, their languages, and computability
• On the computational complexity of the languages of general symbolic dynamical systems and beta-shifts
• Shifts with decidable language and non-computable entropy
• \(\beta\)-shift, numeration systems, and automata
• Computable symbolic dynamics

Mathematics Subject Classification ID

Symbolic dynamics (37B10) Topological entropy (37B40) Constructive and recursive analysis (03F60)

Cited In (3)

• Beta-shifts, their languages, and computability
• On the computational complexity of the languages of general symbolic dynamical systems and beta-shifts
• Permutations and \(\beta \)-shifts

This page was built for publication: Mathematical Foundations of Computer Science 2005

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