Geodesic
On the complexity of one-dimensional universal cellular automata
Diskretnyj analiz i issledovanie operacij, Tome 9 (2002) no. 4, pp. 50-56.

Voir la notice de l'article provenant de la source Math-Net.Ru

@article{DA_2002_9_4_a4,
     author = {I. I. Zakharchuk},
     title = {On the complexity of one-dimensional universal cellular automata},
     journal = {Diskretnyj analiz i issledovanie operacij},
     pages = {50--56},
     publisher = {mathdoc},
     volume = {9},
     number = {4},
     year = {2002},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/DA_2002_9_4_a4/}
}
TY  - JOUR
AU  - I. I. Zakharchuk
TI  - On the complexity of one-dimensional universal cellular automata
JO  - Diskretnyj analiz i issledovanie operacij
PY  - 2002
SP  - 50
EP  - 56
VL  - 9
IS  - 4
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/DA_2002_9_4_a4/
LA  - ru
ID  - DA_2002_9_4_a4
ER  - 
%0 Journal Article
%A I. I. Zakharchuk
%T On the complexity of one-dimensional universal cellular automata
%J Diskretnyj analiz i issledovanie operacij
%D 2002
%P 50-56
%V 9
%N 4
%I mathdoc
%U http://geodesic.mathdoc.fr/item/DA_2002_9_4_a4/
%G ru
%F DA_2002_9_4_a4
I. I. Zakharchuk. On the complexity of one-dimensional universal cellular automata. Diskretnyj analiz i issledovanie operacij, Tome 9 (2002) no. 4, pp. 50-56. http://geodesic.mathdoc.fr/item/DA_2002_9_4_a4/

[1] Aladev V. Z., Odnorodnye struktury: Teoreticheskie i prikladnye aspekty, Tekhnika, Kiev, 1990 | MR

[2] Kudryavtsev V. B., Podkolzin A. S., Bolotov A. A., Osnovy teorii odnorodnykh struktur, Nauka, M., 1990 | MR

[3] S. Wolfram (ed.), Cellular automata and complexity: collected papers, Addison-Wesley, New York, 1994 | Zbl

[4] Lindgren K., Nordahl M. G., “Universal computation in simple one-dimensional cellular automata”, Complex Systems, 4:3 (1990), 299–318 | MR | Zbl

[5] Smith III A. R., “Simple computation-universal cellular spaces”, J. Assoc. Comput. Mach., 18:3 (1971), 339–353 | MR | Zbl