We present a hierarchical construction of 2D subshifts of finite type with a unique direction of non-expansiveness. Our construction combines various techniques that were developed in previous selfsimilar constructions of SFTs and cellular automata.
CITATION STYLE
Zinoviadis, C. (2015). Hierarchy and expansiveness in 2D subshifts of finite type. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8977, pp. 365–377). Springer Verlag. https://doi.org/10.1007/978-3-319-15579-1_28
Mendeley helps you to discover research relevant for your work.