Cellular automata, decidability and phasespace
From MaRDI portal
Publication:3000295
DOI10.3233/FI-2010-340zbMATH Open1214.68238OpenAlexW1594821056MaRDI QIDQ3000295FDOQ3000295
Authors: K. Sutner 
Publication date: 18 May 2011
Published in: Fundamenta Informaticae (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.3233/fi-2010-340
Recommendations
Cited In (17)
- Cellular automata between sofic tree shifts
- Linear cellular automata and decidability
- Computing the periods of preimages in surjective cellular automata
- Cellular automata and \(\delta\)-uniform BSS machines
- Title not available (Why is that?)
- Title not available (Why is that?)
- Cellular automata and intermediate degrees.
- NP problems are tractable in the space of cellular automata in the hyperbolic plane
- Induction and restriction of cellular automata
- On decidability properties of one-dimensional cellular automata
- Title not available (Why is that?)
- Decision Algorithms for Cellular Automata States Based on Periodic Boundary Condition
- Title not available (Why is that?)
- Computational classification of cellular automata
- Model checking one-dimensional cellular automata
- Exact Discretization of 3-Speed Rational Signal Machines into Cellular Automata
- On the dynamical behaviour of linear higher-order cellular automata and its decidability
This page was built for publication: Cellular automata, decidability and phasespace
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3000295)
