Tessellation Automata
From MaRDI portal
Cited in
(24)- T-recognition of T-languages, a new approach to describe and program the parallel pattern recognition capabilities of d-dimensional tessellation structures
- Structural and behavioral equivalence relations in automata networks
- Sequential and cellular graph automata
- The structure of reversible one-dimensional cellular automata
- Homogeneous nets of neuron-like elements
- The behavioral properties of homogeneous structures
- Computation and construction universality of reversible cellular automata
- Certain relations between properties of maps of tessellation automata
- A note on pattern reproduction in tessellation structures
- (A-)synchronous (non)-deterministic cell spaces simulating each other
- Decomposable maps in general tessellation structures
- Pushdown cellular automata
- A completeness problem for pattern generation in tessellation automata
- Pattern reproduction in tessellation automata of arbitrary dimension
- Some regular state sets in the system of one-dimensional iterative automata
- Decision procedures for surjectivity and injectivity of parallel maps for tessellation structures
- Real-time language recognition by one-dimensional cellular automata
- Non-deterministic cellular automata and languages
- Recursive paths in cross-connected trees and an application to cell spaces
- PARALLEL GRAPH GENERATING AND GRAPH RECURRENCE SYSTEMS FOR MULTICELLULAR DEVELOPMENT†
- PROCESSES AND THEIR INTERACTIONS
- On time reduction and simulation in cellular spaces
- Replication of spatial patterns with reversible and additive cellular automata
- A comprehensive taxonomy of cellular automata
This page was built for publication: Tessellation Automata
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5572339)
