(A-)synchronous (non)-deterministic cell spaces simulating each other
From MaRDI portal
Publication:1253921
DOI10.1016/0022-0000(78)90003-XzbMath0397.68049MaRDI QIDQ1253921
Publication date: 1978
Published in: Journal of Computer and System Sciences (Search for Journal in Brave)
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (7)
Towards intrinsically universal asynchronous CA ⋮ Asynchronous game of life ⋮ A survey of cellular automata: types, dynamics, non-uniformity and applications ⋮ Asynchronous communicating cellular automata: formalization, robustness and equivalence ⋮ Synchronous to asynchronous transformation of polyautomata ⋮ Delay-insensitive computation in asynchronous cellular automata ⋮ Asynchronous interpretation of parallel microprograms
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The constructibility of a configuration in a cellular automaton
- Survey of research in the theory of homogeneous structures and their applications
- Fault tolerant cellular spaces
- Fault tolerant cellular automata
- Continuous self-reproduction
- Cellular automata synchronization
- Surjectivity of nondeterministic parallel maps induced by nondeterministic cellular automata
- Some clarifications of the concept of a Garden-of-Eden configuration
- Indecomposable parallel maps in tessellation structures
- Synchronization and computing capabilities of linear asynchronous structures
- A note on asynchronous cellular automata
- Parallel program schemata
- Marked directed graphs
- Synchronisationsgraphen
- Tesselations with local transformations
- Decision procedures for surjectivity and injectivity of parallel maps for tessellation structures
- Real-time language recognition by one-dimensional cellular automata
- On convergence to the møller wave operators
- An optimum solution to the firing squad synchronization problem
- Recursive paths in cross-connected trees and an application to cell spaces
- Two- and three-dimensional firing-squad synchronization problems
- Synchronization of growing cellular arrays
- Synchronization of cellular arrays: The firing squad problem in two dimensions
- The firing squad synchronization problem for two-dimensional arrays
- Properties of a Model for Parallel Computations: Determinacy, Termination, Queueing
- A generalized firing squad problem
- Real-Time Computation by n-Dimensional Iterative Arrays of Finite-State Machines
- Tessellation Automata
- Cellular automata complexity trade-offs
- Structural and behavioral equivalences of tessellation automata
- Toward a Formal Theory of Modeling and Simulation
- Tree-Manipulating Systems and Church-Rosser Theorems
This page was built for publication: (A-)synchronous (non)-deterministic cell spaces simulating each other
