@article{ITA_1999__33_6_535_0, author = {Morita, Kenichi and Margenstern, Maurice and Imai, Katsunobu}, title = {Universality of reversible hexagonal cellular automata}, journal = {RAIRO - Theoretical Informatics and Applications - Informatique Th\'eorique et Applications}, pages = {535--550}, publisher = {EDP-Sciences}, volume = {33}, number = {6}, year = {1999}, mrnumber = {1747515}, zbl = {0953.68099}, language = {en}, url = {http://www.numdam.org/item/ITA_1999__33_6_535_0/} }
TY - JOUR AU - Morita, Kenichi AU - Margenstern, Maurice AU - Imai, Katsunobu TI - Universality of reversible hexagonal cellular automata JO - RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications PY - 1999 SP - 535 EP - 550 VL - 33 IS - 6 PB - EDP-Sciences UR - http://www.numdam.org/item/ITA_1999__33_6_535_0/ LA - en ID - ITA_1999__33_6_535_0 ER -
%0 Journal Article %A Morita, Kenichi %A Margenstern, Maurice %A Imai, Katsunobu %T Universality of reversible hexagonal cellular automata %J RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications %D 1999 %P 535-550 %V 33 %N 6 %I EDP-Sciences %U http://www.numdam.org/item/ITA_1999__33_6_535_0/ %G en %F ITA_1999__33_6_535_0
Morita, Kenichi; Margenstern, Maurice; Imai, Katsunobu. Universality of reversible hexagonal cellular automata. RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 33 (1999) no. 6, pp. 535-550. http://www.numdam.org/item/ITA_1999__33_6_535_0/
[1] Logical reversibility of computation. IBM J. Res. Develop. 17 (1973) 525-532. | MR | Zbl
,[2] Notes on the history of reversible computation. IBM J. Res. Develop. 32 (1988) 16-23. | MR
,[3] Conservative logic, Internat J. Theoret. Phys. 21 (1982) 219-253. | MR | Zbl
and ,[4] A computation-universal two-dimensional 8-state triangular reversible cellular automaton. Theoret. Comput. Sci., to appear. | MR | Zbl
and ,[5] Physics-like model of computation. Physica D 10 (1984) 81-95. | MR | Zbl
,[6] Computation universality of one-dimensional reversible (injective) cellular automata. Trans. IEICE Japan E-72 (1989) 758-762.
and ,[7] A simple construction method of a reversible finite automaton out of Fredkin gates, and its related problem. Trans. IEICE Japan E-73 (1990) 978-984.
,[8] Computation-universal models of two-dimensional 16-state reversible cellular automata. IEICE Trans. Inf. Syst. E75-D (1992) 141-147.
and ,[9] Computation and construction universality of reversible cellular automata. J. Comput. Syst. Sci. 15 (1 1977) 213-231. | MR | Zbl
,[10] Invertible cellular automata: A Review. Physica D 45 (1990) 229-253. | MR | Zbl
and ,