Computation theoretic aspects of cellular automata
type: Item
instance of: scholarly article
title: Computation theoretic aspects of cellular automata
zbMATH Open document ID: 0729.68052
DOI: 10.1016/0167-2789(90)90194-T
author: L. P. Hurd
author: Karel II Culik
author: Sheng Yu
published in: Physica D
publication date: 1990-01-01T00:00:00Z
Mathematics Subject Classification ID: 68Q80
Mathematics Subject Classification ID: 68Q05
zbMATH DE Number: 4206007
zbMATH Keywords: Cellular automata
zbMATH Keywords: computational models
zbMATH Keywords: complex systems
MaRDI profile type: Publication
cites work: Q3675526
cites work: Q3805907
cites work: Q3802661
cites work: Q4089754
cites work: Q3226265
cites work: Endomorphisms and automorphisms of the shift dynamical system
cites work: Simple self-reproducing universal automata
cites work: Q4137150
cites work: Q5590814
cites work: Towards a Precise Characterization of the Complexity of Universal and Nonuniversal Turing Machines
cites work: Simple Computation-Universal Cellular Spaces
cites work: Q3802629
cites work: One-way bounded cellular automata
cites work: Topological transformations as a tool in the design of systolic networks
cites work: Deterministic one-way simulation of two-way real-time cellular automata and its related problems
cites work: Statistical mechanics of cellular automata
cites work: On the computational power of totalistic cellular automata
cites work: On totalistic systolic networks
cites work: Q3322005
cites work: Twenty Problems in the Theory of Cellular Automata
cites work: Q3974887
cites work: A hierarchical classification of cellular automata
cites work: Local structure theory for cellular automata
cites work: Q3805908
cites work: Classes of linear automata
cites work: Q3820011
cites work: On the Limit Sets of Cellular Automata
cites work: Q3358252
cites work: Q5573961
cites work: Computation theory of cellular automata
cites work: Q4198075
cites work: Real-Time Computation by n-Dimensional Iterative Arrays of Finite-State Machines
cites work: Real-time language recognition by one-dimensional cellular automata
cites work: Iterative tree automata
cites work: Cellular automata, \(\omega{} \omega\)-regular sets, and sofic systems
cites work: Subshifts of finite type and sofic systems
cites work: Q4720793
cites work: Q3859267
cites work: Q4168081
cites work: Finitely generated sofic systems
cites work: Formal languages and global cellular automaton behavior
cites work: Q3675524
cites work: Attractors in cellular automata
cites work: Q3471236
cites work: Q3820013
cites work: Q4180600
cites work: Q3210195
cites work: Q3931654
cites work: Q3208089
cites work: The undecidability of the domino problem
cites work: Undecidability and nonperiodicity for tilings of the plane
cites work: The Nilpotency Problem of One-Dimensional Cellular Automata
cites work: Q5333602
cites work: Shorter Note: The Converse of Moore's Garden-of-Eden Theorem
cites work: Decision procedures for surjectivity and injectivity of parallel maps for tessellation structures
cites work: Reversibility and surjectivity problems of cellular automata
cites work: Tesselations with local transformations
cites work: Injectivity and surjectivity of parallel maps for cellular automata
cites work: Computation and construction universality of reversible cellular automata
cites work: Q3805906
cites work: Q3793734
cites work: On the computational complexity of finite cellular automata
cites work: Rice's theorem for the limit sets of cellular automata