On reversible cellular automata with finite cell array

Shuichi Inokuchi, Kazumasa Honda, Hyen Yeal Lee, Tatsuro Sato, Yoshihiro Mizoguchi, Yasuo Kawahara

    Research output: Contribution to journalConference articlepeer-review

    3 Citations (Scopus)


    Discrete quantum cellular automata are cellular automata with reversible transition. This paper deals with Id cellular automata with finite cell array and triplet local transition rules. We present the necessary condition of local transition rules for cellular automata to be reversible, and prove the reversibility of some cellular automata.

    Original languageEnglish
    Pages (from-to)130-141
    Number of pages12
    JournalLecture Notes in Computer Science
    Publication statusPublished - 2005
    Event4th International Conference on Unconventional Computation, UC 2005 - Sevilla, Spain
    Duration: Oct 3 2005Oct 7 2005

    All Science Journal Classification (ASJC) codes

    • Theoretical Computer Science
    • General Computer Science


    Dive into the research topics of 'On reversible cellular automata with finite cell array'. Together they form a unique fingerprint.

    Cite this