Recursive paths in cross-connected trees and an application to cell spaces

DOI10.1007/BF01786971zbMath0473.68065MaRDI QIDQ3928261

Hans-Georg Carstens, Ulrich Golze

Publication date: 1981

Published in: Mathematical Systems Theory (Search for Journal in Brave)

zbMATH Keywords

recursive configurationsrecursive infinite trees

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Cellular automata (computational aspects) (68Q80)

Related Items (1)

(A-)synchronous (non)-deterministic cell spaces simulating each other

Cites Work

• Unnamed Item
• Unnamed Item
• The constructibility of a configuration in a cellular automaton
• Surjectivity of nondeterministic parallel maps induced by nondeterministic cellular automata
• Some clarifications of the concept of a Garden-of-Eden configuration
• Decision procedures for surjectivity and injectivity of parallel maps for tessellation structures
• Confusion in the Garden of Eden
• Tessellation Automata
• The Garden-of-Eden Theorem for Finite Configurations

This page was built for publication: Recursive paths in cross-connected trees and an application to cell spaces