Cellular automata complexity trade-offs
From MaRDI portal
Cited in
(34)- On the relationship between propagating context-dependent Lindenmayer systems and cellular automata systems
- T-recognition of T-languages, a new approach to describe and program the parallel pattern recognition capabilities of d-dimensional tessellation structures
- Microeconomic foundations of cyclical irregularities or chaos
- Two-dimensional iterative arrays: Characterizations and applications
- Relating the power of cellular arrays to their closure properties
- Optimal simulation of tree arrays by linear arrays
- On iterative and cellular tree arrays
- Approximations of cooperative equilibria in multi-person prisoners' dilemma played by cellular automata
- Survey of research in the theory of homogeneous structures and their applications
- Computer simulation of reverberating spreading depression in a network of cell automata
- On reversibility in cellular automata
- On 'forgetful' cellular automata
- Iterative arrays with direct central control
- The firing squad synchronization problem for a class of polyautomata networks
- (A-)synchronous (non)-deterministic cell spaces simulating each other
- Decomposable maps in general tessellation structures
- Impact of time delay on the dynamics of SEIR epidemic model using cellular automata
- A study of chaos in non-uniform cellular automata
- Decision procedures for surjectivity and injectivity of parallel maps for tessellation structures
- Real-time language recognition by one-dimensional cellular automata
- Reducing the local alphabet size in tiling systems by means of 2D comma-free codes
- Asynchronous interpretation of parallel microprograms
- The notion of a probabilistic cellular acceptor
- Some results on time-varying and relativised cellular automata*
- On time reduction and simulation in cellular spaces
- Language classes defined by time-bounded relativised cellular automata
- An improved parallel algorithm for integer GCD
- Simulation of non-uniform cellular automata by classical cellular automata and its application in embedded systems
- A survey of cellular automata: types, dynamics, non-uniformity and applications
- On some open problems concerning the complexity of cellular arrays
- A comprehensive taxonomy of cellular automata
- Nondeterministic, probabilistic and alternating computations on cellular array models
- Theoretical reconciliation of equilibrium and structural approaches
- Languages not recognizable in real time by one-dimensional cellular automata
This page was built for publication: Cellular automata complexity trade-offs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5628032)