On the Non-existance of Rotation-Symmetric von Neumann Neighbor Number-Conserving Cellular Automata of Which the State Number is Less than Four
スポンサーリンク
概要
- 論文の詳細を見る
A number-conserving cellular automaton (NCCA) is a cellular automaton such that all states of cells are represented by integers and the total number of its configuration is conserved throughout its computing process. In constrast to normal cellular automata, there are infinitely many assignments of states for NCCAs with a constant state number. As for von Neumann neighbor(radius one) NCCAs with rotation-symmetry, a local function can be represented by summation of four binary functions. In this paper, we show that the minimum size of state set of rotation-symmetric von Neumann neighbor NCCA is 5 by using this representation.
- (社)電子情報通信学会の論文
- 2009-02-01
著者
-
IWAMOTO Chuzo
Graduate School of Engineering, Hiroshima University
-
MORITA Kenichi
Graduate School of Engineering, Hiroshima University
-
IMAI Katsunobu
Graduate School of Engineering, Hiroshima University
-
Iwamoto Chuzo
Hiroshima Univ. Higashihiroshima‐shi Jpn
-
Iwamoto Chuzo
Graduate School Of Engineering Hiroshima University
-
Morita Kenichi
Hiroshima Univ. Higashihiroshima‐shi Jpn
-
Morita K
Hiroshima Univ. Higashi‐hiroshima‐shi Jpn
-
Morita Kenichi
Graduate School Of Engineering Hiroshima University
-
Imai K
Graduate School Of Engineering Hiroshima University
-
Imai Katsunobu
Graduate School Of Engineering Hiroshima University
-
TANIMOTO Naonori
Graduate School of Engineering, Hiroshima University
-
Tanimoto Naonori
Graduate School Of Engineering Hiroshima University
関連論文
- A Recursive Padding Technique on Nondeterministic Cellular Automata
- NP-Hard and k-EXPSPACE-Hard Cast Puzzles
- Uniquely Parallel Parsable Unification Grammars (Special lssue on Selected Papers from LA Synposium)
- Normal Forms for Uniquely Parsable Grammar Classes Forming the Deterministic Chomsky Hierarchy
- On the Non-existance of Rotation-Symmetric von Neumann Neighbor Number-Conserving Cellular Automata of Which the State Number is Less than Four
- A Recursive Padding Technique on Nondeterministic Cellular Automata
- Prefix Computations on Iterative Arrays with Sequential Input/Output Mode(Cellular Automata)
- A Logically Universal Number-Conserving Cellular Automaton with a Unary Table-Lookup Function(Cellular Automata)
- Time and Space Complexity Classes of Hyperbolic Cellular Automata(Cellular Automata)
- NP-Hard and k-EXPSPACE-Hard Cast Puzzles
- Generalized Shisen-Sho is NP-Complete
- Lower Bound of Face Guards of Polyhedral Terrains
- Generalized Chat Noir is PSPACE-Complete