{"docId":2969,"paperId":2969,"url":"https:\/\/dmtcs.episciences.org\/2969","doi":"10.46298\/dmtcs.2969","journalName":"Discrete Mathematics & Theoretical Computer Science","issn":"","eissn":"1365-8050","volume":[{"vid":261,"name":"DMTCS Proceedings vol. AP, Automata 2011 - 17th International Workshop on Cellular Automata and Discrete Complex Systems"}],"section":[{"sid":66,"title":"Proceedings","description":[]}],"repositoryName":"Hal","repositoryIdentifier":"hal-01196136","repositoryVersion":1,"repositoryLink":"https:\/\/hal.science\/hal-01196136v1","dateSubmitted":"2017-01-31 10:21:26","dateAccepted":null,"datePublished":"2011-01-01 00:00:00","titles":{"en":"Projective subdynamics and universal shifts"},"authors":["Guillon, Pierre"],"abstracts":{"en":"We study the projective subdynamics of two-dimensional shifts of finite type, which is the set of one-dimensional configurations that appear as columns in them. We prove that a large class of one-dimensional shifts can be obtained as such, namely the effective subshifts which contain positive-entropy sofic subshifts. The proof involves some simple notions of simulation that may be of interest for other constructions. As an example, it allows us to prove the undecidability of all non-trivial properties of projective subdynamics."},"keywords":[["multidimensional symbolic dynamics"],["effective dynamics"],["tilings"],["simulation"],["undecidability"],"[INFO.INFO-DM] Computer Science [cs]\/Discrete Mathematics [cs.DM]","[MATH.MATH-DS] Mathematics [math]\/Dynamical Systems [math.DS]","[NLIN.NLIN-CG] Nonlinear Sciences [physics]\/Cellular Automata and Lattice Gases [nlin.CG]","[MATH.MATH-CO] Mathematics [math]\/Combinatorics [math.CO]"]}