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

DOI10.1007/BF01786971MaRDI QIDQ3928261zbMATH OpenFDO

Authors 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)

Cites work

• scientific article; zbMATH DE number 3664365 (Why is no real title available?)
• scientific article; zbMATH DE number 3370263 (Why is no real title available?)
• Confusion in the Garden of Eden
• Decision procedures for surjectivity and injectivity of parallel maps for tessellation structures
• Some clarifications of the concept of a Garden-of-Eden configuration
• Surjectivity of nondeterministic parallel maps induced by nondeterministic cellular automata
• Tessellation Automata
• The Garden-of-Eden Theorem for Finite Configurations
• The constructibility of a configuration in a cellular automaton

Cited in

(1)

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

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

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