scientific article; zbMATH DE number 4114031

zbMath0679.68107MaRDI QIDQ4729363

Klaus Sutner

Publication date: 1988

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

graphsreversibilitymonoidcellular graph automata

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Cellular automata (computational aspects) (68Q80)

Related Items (9)

The set of reversible \(90/150\) cellular automata is regular ⋮ On a modular domination game. ⋮ Predecessor existence problems for finite discrete dynamical systems ⋮ The general \(\sigma \) all-ones problem for trees ⋮ Periodic binary harmonic functions on lattices ⋮ Minimum light number of lit-only \(\sigma\)-game on a tree ⋮ On the complexity of finding large odd induced subgraphs and odd colorings ⋮ Linear cellular automata and the garden-of-eden ⋮ A Survey of the Game “Lights Out!”

This page was built for publication: