| Project/Area Number |
22500015
|
|---|
| Research Category |
Grant-in-Aid for Scientific Research (C)
|
| Allocation Type | Single-year Grants |
|---|
| Section | 一般 |
|---|
| Research Field |
Fundamental theory of informatics
|
|---|
| Research Institution | Hiroshima University |
|---|
Principal Investigator |
IMAI Katsunobu 広島大学, 大学院・工学研究院, 助教 (20253106)
|
|---|
| Project Period (FY) |
2010 – 2012
|
| Project Status |
Completed (Fiscal Year 2012)
|
| Budget Amount *help |
¥2,080,000 (Direct Cost: ¥1,600,000、Indirect Cost: ¥480,000)
Fiscal Year 2012: ¥650,000 (Direct Cost: ¥500,000、Indirect Cost: ¥150,000)
Fiscal Year 2011: ¥910,000 (Direct Cost: ¥700,000、Indirect Cost: ¥210,000)
Fiscal Year 2010: ¥520,000 (Direct Cost: ¥400,000、Indirect Cost: ¥120,000)
|
|---|
| Keywords | オートマトン理論 / 形式言語理論 / セルオートマトン / セル・オートマトン / 保存性 / 可逆性 |
|---|
| Research Abstract |
Although number-conservation is a physics-like constraint for cellular automata and widely studied, there are not so many researches in the view point of their rule programming. In this study, we show that the computational universality of one-dimensional two-neighborhood number-conserving cellular automata. Next we propose a method of designing rules of non-trivial one-dimensional three-neighborhood reversible and number-conserving cellular automata. We also shows that an implementation of partitioned cellular automata on quasi-periodic tilings, because a kind of number-conserving cellular automata can be easily designed employing the framework of partitioned cellular automata.
|
