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

DOI10.1007/BF01786971zbMATH Open0473.68065MaRDI QIDQ3928261FDOQ3928261

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

• Decision procedures for surjectivity and injectivity of parallel maps for tessellation structures
• Surjectivity of nondeterministic parallel maps induced by nondeterministic cellular automata
• The constructibility of a configuration in a cellular automaton
• Some clarifications of the concept of a Garden-of-Eden configuration
• The Garden-of-Eden Theorem for Finite Configurations
• Title not available (Why is that?)
• Tessellation Automata
• Confusion in the Garden of Eden
• Title not available (Why is that?)

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)