Cellular graph automata. I. basic concepts, graph property measurement, closure properties
From MaRDI portal
Publication:3859259
DOI10.1016/S0019-9958(79)90288-2zbMath0424.68029MaRDI QIDQ3859259
Azriel Rosenfeld, Angela Y. Wu
Publication date: 1979
Published in: Information and Control (Search for Journal in Brave)
Formal languages and automata (68Q45) Cellular automata (computational aspects) (68Q80) Graph theory (05C99)
Related Items (11)
Recognition of graphs by automata ⋮ Leader election in plane cellular automata, only with left-right global convention ⋮ Coding for locality in reconstructing permutations ⋮ Sequential and cellular graph automata ⋮ Graph automata for linear graph languages ⋮ Algorithms for weighted graph problems on the modified cellular graph automaton ⋮ Expansive automata networks ⋮ Finite graph automata for linear and boundary graph languages ⋮ Emulating cellular automata in chemical reaction-diffusion networks ⋮ On simulation in automata networks ⋮ On the impact of treewidth in the computational complexity of freezing dynamics
This page was built for publication: Cellular graph automata. I. basic concepts, graph property measurement, closure properties
