Skip to main contentSkip to search
Episciences
Open Access Journals
Sign in(new window)
Discrete Mathematics & Theoretical Computer Science logo
Discrete Mathematics & Theoretical Computer Science
Discrete Mathematics & Theoretical Computer Science logo
Discrete Mathematics & Theoretical Computer Science
Sign in(new window)
Articles & Issues
All articlesAll accepted articlesAll volumesLast volumeSectionsSpecial issuesAuthors
About
The journalIndexing
Boards
Publish
For authorsEthical charter
Submit
Discrete Mathematics & Theoretical Computer Science logo
Contact
|
Credits
eISSN 1365-8050
|
RSS
|
Atom
Episciences
Documentation
|
Acknowledgements
|
Publishing policy
Accessibility: non-compliant
|
Legal mentions
|
Privacy statement
|
Terms of use
  1. Home > Articles & Issues >
  2. Articles >
  3. Projective subdynami ...
Conference paper

Projective subdynamics and universal shifts

Pierre Guillon ORCID (1) (2)
(1) Institut de mathématiques de Luminy
(2) Center for Mathematical Modeling
Download article
Open on HAL
Imported on
January 31, 2017
Published on
December 31, 2010
Last modified on
March 31, 2025
Volume
DMTCS Proceedings vol. AP, Automata 2011 - 17th International Workshop on Cellular Automata and Discrete Complex Systems
Proceedings
DOI
10.46298/dmtcs.2969
License
https://about.hal.science/hal-authorisation-v1
Indicators
653
Views
688
Downloads

Projective subdynamics and universal shifts

Pierre Guillon ORCID (1) (2)
(1) Institut de mathématiques de Luminy
(2) Center for Mathematical Modeling
Abstract
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
  • [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]
  • multidimensional symbolic dynamics
  • effective dynamics
  • tilings
  • simulation
  • undecidability
Cited by

Source: OpenCitations

  • On the Cost of Simulating a Parallel Boolean Automata Network by a Block-Sequential One

    arXiv (Cornell University)

    Authors : Florian Bridoux ORCID, Pierre Guillon ORCID, Kévin Perrot, Sylvain Sené ORCID, Guillaume Theyssier

    Journal reference : Volume , 2017, pp. 112-128

    DOI : 10.1007/978-3-319-55911-7_9
Preview
Loading PDF preview...