A Logically Universal Number-Conserving Cellular Automaton with a Unary Table-Lookup Function(<Special Section>Cellular Automata)
スポンサーリンク
概要
- 論文の詳細を見る
A number-conserving cellular automaton (NCCA) is a cellular automaton (CA) such that all states of cells are represented by integers and the sum of the cell states is conserved throughout its computing process. It can be thought of as a kind of modelization of the physical conservation law of mass or energy. It is known that the local function of a two-dimensional ±45-degree reflection-symmetric von Neumann neighbor NCCA can be represented by linear combinations of a binary function. In spite of the number-conserving constraints, it is possible to design an NCCA with complex rules by employing this representation. In this paper, we study the case in which the binary function depends only on the difference of two cell states, i.e., the case in which the function can be regarded as a unary one and its circuit for applying rules to a cell only need adders and a single value table look up module. Even under this constraint, it is possible to construct a logically universal NCCA.
- 社団法人電子情報通信学会の論文
- 2004-03-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
-
IKAZAKI Akihiko
Graduate School of Engineering, Hiroshima University
-
Ikazaki Akihiko
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