Structural and behavioral equivalences of tessellation automata

DOI10.1016/S0019-9958(71)90281-6zbMATH Open0239.94062MaRDI QIDQ5650328FDOQ5650328

Authors: Hisao Yamada, Serafino Amoroso 

Publication date: 1971

Published in: Information and Control (Search for Journal in Brave)

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cited In (16)

• Fault tolerant cellular spaces
• Fault tolerant cellular automata
• On time reduction and simulation in cellular spaces
• Homogeneous nets of neuron-like elements
• Structural and behavioral equivalence relations in automata networks
• (A-)synchronous (non)-deterministic cell spaces simulating each other
• The constructibility of a configuration in a cellular automaton
• The structure of reversible one-dimensional cellular automata
• Decision procedures for surjectivity and injectivity of parallel maps for tessellation structures
• T-recognition of T-languages, a new approach to describe and program the parallel pattern recognition capabilities of d-dimensional tessellation structures
• Survey of research in the theory of homogeneous structures and their applications
• Decomposable maps in general tessellation structures
• The vector string descriptor as a tool in the analysis of cellular automata systems
• The behavioral properties of homogeneous structures
• A completeness problem for pattern generation in tessellation automata
• Certain relations between properties of maps of tessellation automata

This page was built for publication: Structural and behavioral equivalences of tessellation automata

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5650328)