Universality of reversible hexagonal cellular automata

被引：0
|
作者：
Morita, Kenichi [1 ]
Margenstern, Maurice [2 ]
Imai, Katsunobu [1 ]
机构：
[1] Hiroshima University, Faculty of Engineering, Higashi-Hiroshima 739-8527, Japan
[2] G.I.F.M., Université de Metz, Départment d'Informatique, Île du Saulcy, 57045 Metz Cedex 1, France
来源：
Theoretical Informatics and Applications | 1999年 / 33卷 / 06期
关键词：
D O I：
暂无
中图分类号：
学科分类号：
摘要：
引用
收藏
页码：535 / 550
相关论文
共 50 条
  • [31] Reversible cellular automata based encryption
    Seredynski, M
    Pienkosz, K
    Bouvry, P
    NETWORK AND PARALLEL COMPUTING, PROCEEDINGS, 2004, 3222 : 411 - 418
  • [32] REVERSIBLE CELLULAR AUTOMATA AND CHEMICAL TURBULENCE
    HARTMAN, H
    TAMAYO, P
    PHYSICA D, 1990, 45 (1-3): : 293 - 306
  • [33] Quantum walks and reversible cellular automata
    Konno, N
    Mistuda, K
    Soshi, I
    Yoo, HJ
    PHYSICS LETTERS A, 2004, 330 (06) : 408 - 417
  • [34] Reversible Cellular Automata Based Cryptosystem
    Stanica, George Cosmin
    Anghelescu, Petre
    ELECTRONICS, 2024, 13 (13)
  • [35] On the structure of the set of reversible cellular automata
    Kucherenko, I. V.
    DISCRETE MATHEMATICS AND APPLICATIONS, 2007, 17 (05): : 495 - 515
  • [36] Counting Cycles in Reversible Cellular Automata
    Das, Sukanta
    Chakraborty, Avik
    Sikdar, Biplab K.
    CELLULAR AUTOMATA, ACRI 2012, 2012, 7495 : 11 - 19
  • [37] Embedding cellular automata into reversible ones
    Hertling, P
    UNCONVENTIONAL MODELS OF COMPUTATION, 1998, : 243 - 256
  • [38] Universality for two-dimensional critical cellular automata
    Bollobas, Bela
    Duminil-Copin, Hugo
    Morris, Robert
    Smith, Paul
    PROCEEDINGS OF THE LONDON MATHEMATICAL SOCIETY, 2023, 126 (02) : 620 - 703
  • [39] UNIVERSALITY ALONG THE CRITICAL LINE OF THE ISING CELLULAR AUTOMATA
    MACISAAC, AB
    JOURNAL OF PHYSICS A-MATHEMATICAL AND GENERAL, 1990, 23 (17): : L899 - L903
  • [40] Universality and decidability of number-conserving cellular automata
    Moreira, A
    THEORETICAL COMPUTER SCIENCE, 2003, 292 (03) : 711 - 721
12345