scientific article; zbMATH DE number 1944403

MaRDI QIDQ4407707zbMATH OpenFDO

Authors Aviezri S. Fraenkel

Publication date 1 July 2003

Full work available at URL http://www.msri.org/communications/books/Book42/

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Cellular automata (computational aspects) (68Q80) 2-person games (91A05) Games involving graphs (91A43) Combinatorial games (91A46)

Recommendations

• scientific article; zbMATH DE number 1759684
• Impartial games emulating one-dimensional cellular automata and undecidability
• Gurevich-Harrington's games defined by finite automata
• \(\sigma\)-game, \(\sigma ^{+}\)-game and two-dimensional additive cellular automata
• scientific article; zbMATH DE number 8789

Cited in

(12)

• Does the lit-only restriction make any difference for the \(\sigma \)-game and \(\sigma ^+\)-game?
• Complexity, appeal and challenges of combinatorial games
• Percolation games, probabilistic cellular automata, and the hard-core model
• A Survey of the Game “Lights Out!”
• Impartial games emulating one-dimensional cellular automata and undecidability
• scientific article; zbMATH DE number 718621 (Why is no real title available?)
• scientific article; zbMATH DE number 1759684 (Why is no real title available?)
• A cellular automaton for blocking queen games
• A Pedagogical Example: A Family of Stochastic Cellular Automata that Plays Alesia
• The complexity of node blocking for dags
• \(\sigma\)-game, \(\sigma ^{+}\)-game and two-dimensional additive cellular automata
• Minimum light number of lit-only \(\sigma\)-game on a tree

This page was built for publication:

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