reversible cellular automaton;
universality;
cyclic tag system;
D O I:
暂无
中图分类号:
TP301 [理论、方法];
学科分类号:
081202 ;
摘要:
We study a problem of finding universal one-dimensional reversible (injective) cellular automata (RCAs) with a small number of states. We first give a 36-state universal RCA that operates on an infinite configuration that can simulate any cyclic tag system (CTAG). We then give a 98-state model that operates on a finite configuration and can also manage halting of a CTAG.
机构:
Univ Grenoble, Lab LIG, F-38400 St Martin Dheres, France
Ecole Normale Super Lyon, Lab LIP, F-69364 Lyon 07, FranceUniv Grenoble, Lab LIG, F-38400 St Martin Dheres, France
Arrighi, Pablo
Nesme, Vincent
论文数: 0引用数: 0
h-index: 0
机构:
Univ Potsdam, D-14476 Potsdam, GermanyUniv Grenoble, Lab LIG, F-38400 St Martin Dheres, France
Nesme, Vincent
Werner, Reinhard
论文数: 0引用数: 0
h-index: 0
机构:
Leibniz Univ Hannover, Inst Theoret Phys, D-30167 Hannover, GermanyUniv Grenoble, Lab LIG, F-38400 St Martin Dheres, France