Turnitin
降AI改写
早检测系统
早降重系统
Turnitin-UK版
万方检测-期刊版
维普编辑部版
Grammarly检测
Paperpass检测
checkpass检测
PaperYY检测
A brief history of cellular automata
Cellular automata are simple models of computation which exhibit fascinatingly complex
behavior. They have captured the attention of several generations of researchers, leading to …
behavior. They have captured the attention of several generations of researchers, leading to …
VLSI architecture of a cellular automata machine
In the past, Cellular Automata based models and machines [1] have been proposed for
simulation of physical systems without any analytical insight into the behaviour of the …
simulation of physical systems without any analytical insight into the behaviour of the …
[PDF][PDF] Combinatorial games: selected bibliography with a succinct gourmet introduction
AS Fraenkel - Games of no Chance, 2009 - nzdr.ru
Roughly speaking, the family of combinatorial games consists of two-player games with
perfect information (no hidden information as in some card games), no chance moves (no …
perfect information (no hidden information as in some card games), no chance moves (no …
Combinatorial games: selected bibliography with a succinct gourmet introduction
A Fraenkel - The Electronic Journal of Combinatorics, 2012 - combinatorics.org
Roughly speaking, the family of combinatorial games consists of two-player games with
perfect information (no hidden information as in some card games), no chance moves (no …
perfect information (no hidden information as in some card games), no chance moves (no …
On Nori's fundamental group scheme
On Nori’s Fundamental Group Scheme Page 1 Progress in Mathematics, Vol. 265, 377–398
c© 2007 Birkhäuser Verlag Basel/Switzerland On Nori’s Fundamental Group Scheme Hél`ene …
c© 2007 Birkhäuser Verlag Basel/Switzerland On Nori’s Fundamental Group Scheme Hél`ene …
σ-automata and Chebyshev-polynomials
A σ-automaton is an additive, binary cellular automaton on a graph. For product graphs such
as a grids and cylinders, reversibility and periodicity properties of the corresponding σ …
as a grids and cylinders, reversibility and periodicity properties of the corresponding σ …
Note on the lamp lighting problem
We answer some questions concerning the so-called σ-game of Sutner [Linear cellular
automata and the Garden of Eden, Math. Intelligencer11 (1989), 49–53]. It is played on a …
automata and the Garden of Eden, Math. Intelligencer11 (1989), 49–53]. It is played on a …
A survey of the game “Lights Out!”
Lights Out! is an electrical game played on a 5× 5-grid where each cell has a button and an
indicator light. Pressing the button will change the light of the cell and the lights of its …
indicator light. Pressing the button will change the light of the cell and the lights of its …
Chebyshev polynomials over finite fields and reversibility of σ-automata on square grids
Using number theory on function fields and algebraic number fields, we prove results about
Chebyshev polynomials over finite prime fields to investigate reversibility of two-dimensional …
Chebyshev polynomials over finite prime fields to investigate reversibility of two-dimensional …
Multidimensional σ-automata, π-polynomials and generalised S-matrices
In this article we study σ (σ+)-automata on finite multidimensional grids with different
boundary conditions. We obtain a natural representation of the global linear map of such …
boundary conditions. We obtain a natural representation of the global linear map of such …