Tessellation Automata
From MaRDI portal
Publication:5572339
DOI10.1016/S0019-9958(69)90090-4zbMath0182.33403OpenAlexW4212789420MaRDI QIDQ5572339
Serafino Amoroso, Hisao Yamada
Publication date: 1969
Published in: Information and Control (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0019-9958(69)90090-4
Related Items (23)
T-recognition of T-languages, a new approach to describe and program the parallel pattern recognition capabilities of d-dimensional tessellation structures ⋮ On time reduction and simulation in cellular spaces ⋮ Structural and behavioral equivalence relations in automata networks ⋮ Sequential and cellular graph automata ⋮ The structure of reversible one-dimensional cellular automata ⋮ PARALLEL GRAPH GENERATING AND GRAPH RECURRENCE SYSTEMS FOR MULTICELLULAR DEVELOPMENT† ⋮ PROCESSES AND THEIR INTERACTIONS ⋮ 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 ⋮ A completeness problem for pattern generation in tessellation automata ⋮ Pattern reproduction in tessellation automata of arbitrary dimension ⋮ Pushdown cellular automata ⋮ 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 ⋮ Recursive paths in cross-connected trees and an application to cell spaces ⋮ Non-deterministic cellular automata and languages ⋮ Replication of spatial patterns with reversible and additive cellular automata
This page was built for publication: Tessellation Automata
