The expressiveness of quasiperiodic and minimal shifts of finite type

DOI10.1017/etds.2019.112zbMath1461.37022arXiv1802.01461OpenAlexW3098107425WikidataQ114119526 ScholiaQ114119526MaRDI QIDQ4964767

Andrei Romashchenko, Bruno Durand

Publication date: 3 March 2021

Published in: Ergodic Theory and Dynamical Systems (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1802.01461

zbMATH Keywords

quasiperiodicitytilingsminimal SFT

Mathematics Subject Classification ID

Symbolic dynamics (37B10) Applications of computability and recursion theory (03D80) Quasicrystals and aperiodic tilings in discrete geometry (52C23) Tiling dynamics (37B52) Multidimensional shifts of finite type (37B51)

Cites Work

• Simulation of effective subshifts by two-dimensional subshifts of finite type
• Turing degrees of multidimensional SFTs
• Fixed-point tile sets and their applications
• A characterization of the entropies of multidimensional shifts of finite type
• On the dynamics and recursive properties of multidimensional symbolic systems
• Reliable computation with cellular automata
• Classical recursion theory. The theory of functions and sets of natural numbers.
• Lots of aperiodic sets of tiles
• Seas of squares with sizes from a \(\Pi_{1}^{0}\) set
• Tilings and quasiperiodicity.
• A self-similar aperiodic set of 19 Wang tiles
• Turing degree spectra of minimal subshifts
• Undecidability and nonperiodicity for tilings of the plane
• Hierarchy and Expansiveness in 2D Subshifts of Finite Type
• Quasiperiodicity and Non-computability in Tilings
• Complex tilings
• Two-by-Two Substitution Systems and the Undecidability of the Domino Problem
• Nonrecursive tilings of the plane. I
• Nonrecursive tilings of the plane. II
• On the Expressive Power of Quasiperiodic SFT.
• Forbidden Substrings, Kolmogorov Complexity and Almost Periodic Sequences
• The undecidability of the domino problem
• Unnamed Item
• Unnamed Item
• Unnamed Item