Kenichi Morita

140 papers B 5C 13Misc 1Journal 79Unranked 29
YearRankTypeTitle / Venue / Authors
2025 — ch.
Composing a Rotary Element in Simple Reversible Cellular Automata to Make Reversible Computers.
Advances in Cellular Automata - Volume 1: Theory (1)
Kenichi Morita
2024 J jnl
A Universal Reversible Turing Machine that Directly Simulates Reversible Counter Machines.
Comput. Sci. J. Moldova
Kenichi Morita
2024 — conf
Making and Using a Rotary Element in Reversible Cellular Automata.
ASCAT
Kenichi Morita
2024 — book
Reversible World of Cellular Automata - Fantastic Phenomena and Computing in Artificial Reversible Universe
Reversible World of Cellular Automata
Kenichi Morita
2023 J jnl
Making Reversible Computing Machines in a Reversible Cellular Space.
Bull. EATCS
Kenichi Morita
2022 — conf
Computing in a Simple Reversible and Conservative Cellular Automaton.
ASCAT
Kenichi Morita
2022 J jnl
Efficient and Accurate Skeleton-Based Two-Person Interaction Recognition Using Inter- and Intra-body Graphs.
CoRR
Yoshiki Ito, Quan Kong, Kenichi Morita, Tomoaki Yoshinaga
2022 B conf
Efficient and Accurate Skeleton-Based Two-Person Interaction Recognition Using Inter-and Intra-Body Graphs.
ICIP
Yoshiki Ito, Quan Kong, Kenichi Morita, Tomoaki Yoshinaga
2022 J jnl
Fredkin gates in simple reversible cellular automata.
Int. J. Parallel Emergent Distributed Syst.
Kenichi Morita
2022 — conf
Reversible Elementary Triangular Partitioned Cellular Automata and Their Complex Behavior.
Automata and Complexity
Kenichi Morita
2022 J jnl
Time-reversal symmetries in two-dimensional reversible partitioned cellular automata and their applications.
Int. J. Parallel Emergent Distributed Syst.
Kenichi Morita
2021 J jnl
An instruction set for reversible Turing machines.
Acta Informatica
Kenichi Morita
2021 J jnl
Constructing Reversible Turing Machines in a Reversible and Conservative Elementary Triangular Cellular Automaton.
J. Autom. Lang. Comb.
Kenichi Morita
2021 C conf
How Can We Construct Reversible Turing Machines in a Very Simple Reversible Cellular Automaton?
RC
Kenichi Morita
2021 J jnl
Multi-Stream Adaptive Graph Convolutional Network Using Inter- and Intra-Body Graphs for Two-Person Interaction Recognition.
IEEE Access
Yoshiki Ito, Kenichi Morita, Quan Kong, Tomoaki Yoshinaga
2021 J jnl
On Wave-Based Majority Gates with Cellular Automata.
CoRR
Genaro J. Martínez, Andrew Adamatzky, Shigeru Ninagawa, Kenichi Morita
2019 J jnl
A universal non-conservative reversible elementary triangular partitioned cellular automaton that shows complex behavior.
Nat. Comput.
Kenichi Morita
2019 J jnl
Reversible Marker Automata on Two-Dimensional Tapes.
Int. J. Unconv. Comput.
Kenichi Morita
2018 — ch.
A Snapshot of My Life.
Reversibility and Universality
Kenichi Morita
2018 J jnl
Conservative Computing in a One-dimensional Cellular Automaton with Memory.
J. Cell. Autom.
Genaro J. Martínez, Kenichi Morita
2018 J jnl
Language Recognition by Reversible Partitioned Cellular Automata and Iterative Arrays.
J. Cell. Autom.
Kenichi Morita
2018 — ch.
Logical Gates via Gliders Collisions.
Reversibility and Universality
Genaro J. Martínez, Andrew Adamatzky, Kenichi Morita
2018 J jnl
Logical Gates via Gliders Collisions.
CoRR
Genaro J. Martínez, Andrew Adamatzky, Kenichi Morita
2017 J jnl
Finding a Pathway from Reversible Microscopic Laws to Reversible Computers.
Int. J. Unconv. Comput.
Kenichi Morita
2017 — book
Theory of Reversible Computing
Kenichi Morita
2016 — conf
An 8-State Simple Reversible Triangular Cellular Automaton that Exhibits Complex Behavior.
Automata
Kenichi Morita
2016 — conf
Universality of 8-State Reversible and Conservative Triangular Partitioned Cellular Automata.
ACRI
Kenichi Morita
2015 J jnl
General design of reversible sequential machines based on reversible logic elements.
Theor. Comput. Sci.
Ming-Xiao Tang, Jia Lee, Kenichi Morita
2015 J jnl
Universal Reversible Turing Machines with a Small Number of Tape Symbols.
Fundam. Informaticae
Kenichi Morita
2014 — conf
Compact Realization of Reversible Turing Machines by 2-State Reversible Logic Elements.
UCNC
Kenichi Morita, Rei Suyama
2014 — conf
How Can We Construct Reversible Machines Out of Reversible Logic Element with Memory?
Computing with New Resources
Kenichi Morita, Tsuyoshi Ogiro
2014 — conf
Language Recognition by Reversible Partitioned Cellular Automata.
Automata
Kenichi Morita
2014 J jnl
Reversibility in space-bounded computation.
Int. J. Gen. Syst.
Kenichi Morita
2014 — conf
Reversible Turing machines with a small number of states.
NCMA
Kenichi Morita
2014 J jnl
Universality Problems on Reversible Logic Elements with 1-Bit Memory.
Int. J. Unconv. Comput.
Yuta Mukai, Tsuyoshi Ogiro, Kenichi Morita
2013 J jnl
Brownian Circuits: Fundamentals.
ACM J. Emerg. Technol. Comput. Syst.
Ferdinand Peper, Jia Lee, Josep Carmona, Jordi Cortadella, Kenichi Morita
2013 J jnl
Generalized Chat Noir is PSPACE-Complete.
IEICE Trans. Inf. Syst.
Chuzo Iwamoto, Yuta Mukai, Yuichi Sumida, Kenichi Morita
2013 C conf
Reversible Logic Elements with Memory and Their Universality.
MCU
Kenichi Morita
2012 C conf
A Deterministic Two-Way Multi-head Finite Automaton Can Be Converted into a Reversible One with the Same Number of Heads.
RC
Kenichi Morita
2012 J jnl
A Polynomial-Time Reduction from the 3SAT Problem to the Generalized String Puzzle Problem.
Algorithms
Chuzo Iwamoto, Kento Sasaki, Kenichi Morita
2012 J jnl
Computation in reversible cellular automata.
Int. J. Gen. Syst.
Kenichi Morita
2012 — conf
Computational Complexity of String Puzzles.
CATS
Chuzo Iwamoto, Kento Sasaki, Kenichi Morita
2012 J jnl
Design of 1-tape 2-symbol reversible Turing machines based on reversible logic elements.
Theor. Comput. Sci.
Jia Lee, Rui-Long Yang, Kenichi Morita
2012 J jnl
Editorial for special issue on unconventional computation.
Nat. Comput.
Jon Timmis, Kenichi Morita
2012 J jnl
Finding the Minimum Number of Face Guards is NP-Hard.
IEICE Trans. Inf. Syst.
Chuzo Iwamoto, Yusuke Kitagaki, Kenichi Morita
2012 J jnl
Generalized Shisen-Sho is NP-Complete.
IEICE Trans. Inf. Syst.
Chuzo Iwamoto, Yoshihiro Wada, Kenichi Morita
2012 J jnl
Lower Bound of Face Guards of Polyhedral Terrains.
Inf. Media Technol.
Chuzo Iwamoto, Junichi Kishi, Kenichi Morita
2012 J jnl
Lower Bound of Face Guards of Polyhedral Terrains.
J. Inf. Process.
Chuzo Iwamoto, Junichi Kishi, Kenichi Morita
2012 J jnl
Non-degenerate 2-State Reversible Logic Elements with Three or More Symbols Are All Universal.
J. Multiple Valued Log. Soft Comput.
Kenichi Morita, Tsuyoshi Ogiro, Artiom Alhazov
2012 J jnl
Realizing Reversible Logic Elements with Memory in the Billiard Ball Model.
Int. J. Unconv. Comput.
Yuta Mukai, Kenichi Morita
2012 — ch.
Reversible Cellular Automata.
Handbook of Natural Computing
Kenichi Morita
2012 Misc conf
Reversible Computing Systems, Logic Circuits, and Cellular Automata.
ICNC
Kenichi Morita
2012 J jnl
Sequential and maximally parallel multiset rewriting: reversibility and determinism.
Nat. Comput.
Artiom Alhazov, Rudolf Freund, Kenichi Morita
2012 — conf
Universality of One-Dimensional Reversible and Number-Conserving Cellular Automata
AUTOMATA & JAC
Kenichi Morita
2011 J jnl
Design of Reversible and Quantum Circuits (Dagstuhl Seminar 11502).
Dagstuhl Reports
Kenichi Morita, Robert Wille
2011 J jnl
Simulating reversible Turing machines and cyclic tag systems by one-dimensional reversible cellular automata.
Theor. Comput. Sci.
Kenichi Morita
2011 J jnl
Two-Way Reversible Multi-Head Finite Automata.
Fundam. Informaticae
Kenichi Morita
2010 — ch.
Computation with Competing Patterns in Life-Like Automaton.
Game of Life Cellular Automata
Genaro J. Martínez, Andrew Adamatzky, Kenichi Morita, Maurice Margenstern
2010 — conf
Computation with competing patterns in Life-like automaton.
HPCS
Genaro Juárez Martínez, Andrew Adamatzky, Kenichi Morita, Maurice Margenstern
2010 C conf
Majority Adder Implementation by Competing Patterns in Life-Like Rule
UC
Genaro Juárez Martínez, Kenichi Morita, Andrew Adamatzky, Maurice Margenstern
2010 J jnl
NP-Hard and
IEICE Trans. Inf. Syst.
Chuzo Iwamoto, Kento Sasaki, Kenji Nishio, Kenichi Morita
2010 C conf
Reversibility and Determinism in Sequential Multiset Rewriting.
UC
Artiom Alhazov, Rudolf Freund, Kenichi Morita
2010 C ed.
Unconventional Computation - 9th International Conference, UC 2010, Tokyo, Japan, June 21-25, 2010. Proceedings
UC
Cristian S. Calude, Masami Hagiya, Kenichi Morita, Grzegorz Rozenberg, Jon Timmis
2009 B conf
Computational Complexity of Cast Puzzles.
ISAAC
Chuzo Iwamoto, Kento Sasaki, Kenji Nishio, Kenichi Morita
2009 — conf
On Designing Gliders in Three-Dimensional Larger than Life Cellular Automata.
IWNC
Katsunobu Imai, Yasuaki Masamori, Chuzo Iwamoto, Kenichi Morita
2009 — conf
On Reversibility and Determinism in P Systems.
Workshop on Membrane Computing
Artiom Alhazov, Kenichi Morita
2009 J jnl
On the Non-existance of Rotation-Symmetric von Neumann Neighbor Number-Conserving Cellular Automata of Which the State Number is Less than Four.
IEICE Trans. Inf. Syst.
Naonori Tanimoto, Katsunobu Imai, Chuzo Iwamoto, Kenichi Morita
2009 — ch.
Reversible Cellular Automata.
Encyclopedia of Complexity and Systems Science
Kenichi Morita
2009 — ch.
Reversible Computing.
Encyclopedia of Complexity and Systems Science
Kenichi Morita
2009 — conf
Universality Issues in Reversible Computing Systems and Cellular Automata (Extended Abstract).
RC@ETAPS
Kenichi Morita
2009 — conf
Universality of 2-State 3-Symbol Reversible Logic Elements - A Direct Simulation Method of a Rotary Element.
IWNC
Tsuyoshi Ogiro, Artiom Alhazov, Tsuyoshi Tanizawa, Kenichi Morita
2008 — conf
A 24-state universal one-dimensional reversible cellular automaton.
Automata
Kenichi Morita
2008 — conf
A Java based three-dimensional cellular automata simulator and its application to three-dimensional Larger than Life.
Automata
Mitsuru Matsushima, Katsunobu Imai, Chuzo Iwamoto, Kenichi Morita
2008 J jnl
A Recursive Padding Technique on Nondeterministic Cellular Automata.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci.
Chuzo Iwamoto, Harumasa Yoneda, Kenichi Morita, Katsunobu Imai
2008 — conf
An Asynchronous Cellular Automaton Implementing 2-State 2-Input 2-Output Reversed-Twin Reversible Elements.
ACRI
Jia Lee, Ferdinand Peper, Susumu Adachi, Kenichi Morita
2008 — ed.
Automata 2008: Theory and Applications of Cellular Automata, Bristol, UK, June 12-14, 2008
Andrew Adamatzky, Ramón Alonso-Sanz, Anna T. Lawniczak, Genaro Juárez Martínez, Kenichi Morita, Thomas Worsch
2008 — conf
Computing by Swarm Networks.
ACRI
Teijiro Isokawa, Ferdinand Peper, Masahiko Mitsui, Jian-Qin Liu, Kenichi Morita, Hiroshi Umeo, Naotake Kamiura, Nobuyuki Matsui
2008 J jnl
Editorial.
J. Cell. Autom.
Kenichi Morita
2008 J jnl
Reversible computing and cellular automata - A survey.
Theor. Comput. Sci.
Kenichi Morita
2007 C conf
A Time Hierarchy Theorem for Nondeterministic Cellular Automata.
TAMC
Chuzo Iwamoto, Harumasa Yoneda, Kenichi Morita, Katsunobu Imai
2007 C conf
A Universal Reversible Turing Machine.
MCU
Kenichi Morita, Yoshikazu Yamaguchi
2007 — conf
Pattern Generation and Parsing by Array Grammars.
Formal Models, Languages and Applications
Kenichi Morita, Jin-Shan Qi, Katsunobu Imai
2007 J jnl
Simple Universal One-Dimensional Reversible Cellular Automata.
J. Cell. Autom.
Kenichi Morita
2007 J jnl
Translational lemmas for DLOGTIME-uniform circuits, alternating TMs, and PRAMs.
Acta Informatica
Chuzo Iwamoto, Naoki Hatayama, Yoshiaki Nakashiba, Kenichi Morita, Katsunobu Imai
2006 J jnl
A Five-State von Neumann Neighbor Universal Hyperbolic Cellular Automaton.
J. Cell. Autom.
Katsunobu Imai, Chuzo Iwamoto, Kenichi Morita
2005 B conf
Translational Lemmas for Alternating TMs and PRAMs.
FCT
Chuzo Iwamoto, Yoshiaki Nakashiba, Kenichi Morita, Katsunobu Imai
2004 J jnl
A Logically Universal Number-Conserving Cellular Automaton with a Unary Table-Lookup Function.
IEICE Trans. Inf. Syst.
Katsunobu Imai, Akihiko Ikazaki, Chuzo Iwamoto, Kenichi Morita
2004 C conf
Classification and Universality of Reversible Logic Elements with One-Bit Memory.
MCU
Kenichi Morita, Tsuyoshi Ogiro, Keiji Tanaka, Hiroko Kato
2004 C conf
Hierarchies of DLOGTIME-Uniform Circuits.
MCU
Chuzo Iwamoto, Naoki Hatayama, Kenichi Morita, Katsunobu Imai, Daisuke Wakamatsu
2004 J jnl
Nondegenerate 2-State 3-Symbol Reversible Logic Elements Are All Universal.
Int. J. Unconv. Comput.
Tsuyoshi Ogiro, Atsushi Kanno, Keiji Tanaka, Hiroko Kato, Kenichi Morita
2004 J jnl
Prefix Computations on Iterative Arrays with Sequential Input/Output Mode.
IEICE Trans. Inf. Syst.
Chuzo Iwamoto, Tomoka Yokouchi, Kenichi Morita, Katsunobu Imai
2004 J jnl
Simple Universal Reversible Cellular Automata in Which Reversible Logic Elements Can Be Embedded.
IEICE Trans. Inf. Syst.
Kenichi Morita, Tsuyoshi Ogiro
2004 J jnl
Universal Delay-Insensitive Circuits with Bidirectional and Buffering Lines.
IEEE Trans. Computers
Jia Lee, Ferdinand Peper, Susumu Adachi, Kenichi Morita
2003 — conf
A New Universal Logic Element for Reversible Computing.
Grammars and Automata for String Processing
Kenichi Morita
2003 J jnl
Embedding Universal Delay-Insensitive Circuits in Asynchronous Cellular Spaces.
Fundam. Informaticae
Jia Lee, Susumu Adachi, Ferdinand Peper, Kenichi Morita
2003 J jnl
Simulation of one-dimensional cellular automata by uniquely parallel parsable grammars.
Theor. Comput. Sci.
Jia Lee, Katsunobu Imai, Kenichi Morita
2003 J jnl
Simulations Between Multi-dimensional Deterministic and Alternating Cellular Automata.
Fundam. Informaticae
Chuzo Iwamoto, Katsuyuki Tateishi, Kenichi Morita, Katsunobu Imai
2002 J jnl
A quadratic speedup theorem for iterative arrays.
Acta Informatica
Chuzo Iwamoto, Katsuyuki Tateishi, Kenichi Morita, Katsunobu Imai
2002 B conf
Computational Complexity in the Hyperbolic Plane.
MFCS
Chuzo Iwamoto, Takeshi Andou, Kenichi Morita, Katsunobu Imai
2002 J jnl
Constructible functions in cellular automata and their applications to hierarchy results.
Theor. Comput. Sci.
Chuzo Iwamoto, Tomonobu Hatsuyama, Kenichi Morita, Katsunobu Imai
2002 — conf
Embedding a Logically Universal Model and a Self-Reproducing Model into Number-Conserving Cellular Automata.
UMC
Katsunobu Imai, Kenji Fujita, Chuzo Iwamoto, Kenichi Morita
2002 J jnl
Firing Squad Synchronization Problem in Number-Conserving Cellular Automata.
Fundam. Informaticae
Katsunobu Imai, Kenichi Morita, Kenji Sako
2002 — conf
Reversible Computation in Asynchronous Cellular Automata.
UMC
Jia Lee, Ferdinand Peper, Susumu Adachi, Kenichi Morita, Shinro Mashiko
2002 J jnl
Self-Reproduction in Three-Dimensional Reversible Cellular Space.
Artif. Life
Katsunobu Imai, Takahiro Hori, Kenichi Morita
2002 — ch.
Universal Computing in Reversible and Number-Conserving Two-Dimensional Cellular Spaces.
Collision-Based Computing
Kenichi Morita, Yasuyuki Tojima, Katsunobu Imai, Tsuyoshi Ogiro
2001 C conf
A Simple Universal Logic Element and Cellular Automata for Reversible Computing.
MCU
Kenichi Morita
2001 C conf
A three-dimensional uniquely parsable array grammar that generates and parses cubes.
IWCIA
Katsunobu Imai, Yukio Matsuda, Chuzo Iwamoto, Kenichi Morita
2001 — conf
Generation and Parsing of Morphism Languages by Uniquely Parallel Parsable Grammars.
Words, Semigroups, and Transductions
Jia Lee, Kenichi Morita
2001 J jnl
NP problems are tractable in the space of cellular automata in the hyperbolic plane.
Theor. Comput. Sci.
Maurice Margenstern, Kenichi Morita
2001 J jnl
Number-Conserving Reversible Cellular Automata and Their Computation-Universality.
RAIRO Theor. Informatics Appl.
Kenichi Morita, Katsunobu Imai
2001 C conf
Speeding-Up Cellular Automata by Alternations.
MCU
Chuzo Iwamoto, Katsuyuki Tateishi, Kenichi Morita, Katsunobu Imai
2000 J jnl
A computation-universal two-dimensional 8-state triangular reversible cellular automaton.
Theor. Comput. Sci.
Katsunobu Imai, Kenichi Morita
2000 — conf
Characterizing the Class of Deterministic Context-Free Languages by Semi-Right-Terminating Uniquely Parsable Grammars.
Recent Topics in Mathematical and Computational Linguistics
Kenichi Morita, Jia Lee
2000 J jnl
Uniquely Parsable Unification Grammars and Their Parser Implemented in Prolog.
Grammars
Jia Lee, Kenichi Morita, Hiroki Asou, Katsunobu Imai
1999 J jnl
A Polynomial Solution for 3-SAT in the Space of Cellular Automata in the Hyperbolic Plane.
J. Univers. Comput. Sci.
Maurice Margenstern, Kenichi Morita
1999 J jnl
Characterizing the Ability of Parallel Array Generators on Reversible Partitioned Cellular Automata.
Int. J. Pattern Recognit. Artif. Intell.
Kenichi Morita, Satoshi Ueno, Katsunobu Imai
1999 B conf
On Time-Constructible Functions in One-Dimensional Cellular Automata.
FCT
Chuzo Iwamoto, Tomonobu Hatsuyama, Kenichi Morita, Katsunobu Imai
1999 J jnl
Uniquely parsable array grammars for generating and parsing connected patterns.
Pattern Recognit.
Kenichi Morita, Katsunobu Imai
1999 J jnl
Universality of Reversible Hexagonal Cellular Automata.
RAIRO Theor. Informatics Appl.
Kenichi Morita, Maurice Margenstern, Katsunobu Imai
1998 — conf
A computation-universal two-dimensional 8-state triangular reversible cellular automaton.
MCU (2)
Katsunobu Imai, Kenichi Morita
1997 J jnl
A Hierarchy of Uniquely Parsable Grammar Classes and Deterministic Acceptors.
Acta Informatica
Kenichi Morita, Noritaka Nishihara, Yasunori Yamamoto, Zhiguo Zhang
1996 J jnl
Firing Squad Synchronization Problem in Reversible Cellular Automata.
Theor. Comput. Sci.
Katsunobu Imai, Kenichi Morita
1996 — conf
Logical Universality and Self-Reproduction in Reversible Cellular Automata.
ICES
Kenichi Morita, Katsunobu Imai
1996 J jnl
Self-Reproduction in a Reversible Cellular Space.
Theor. Comput. Sci.
Kenichi Morita, Katsunobu Imai
1996 J jnl
Universality of a Reversible Two-Counter Machine.
Theor. Comput. Sci.
Kenichi Morita
1995 J jnl
Reversible Simulation of One-Dimensional Irreversible Cellular Automata.
Theor. Comput. Sci.
Kenichi Morita
1994 J jnl
Parallel Generation and Parsing of Array Languages Using Reversible Cellular Automata.
Int. J. Pattern Recognit. Artif. Intell.
Kenichi Morita, Satoshi Ueno
1992 J jnl
Computation-Universality of One-Dimensional One-Way Reversible Cellular Automata.
Inf. Process. Lett.
Kenichi Morita
1992 — conf
Parallel Generation and Parsing of Array Languages Using Reversible Cellular Automata.
ICPIA
Kenichi Morita, Satoshi Ueno
1992 J jnl
Two-Dimensional Uniquely Parsable Isometric Array Grammars.
Int. J. Pattern Recognit. Artif. Intell.
Yasunori Yamamoto, Kenichi Morita
1990 J jnl
An extended syllogistic system with verbs and proper nouns, and its completeness proof.
Syst. Comput. Jpn.
Noritaka Nishihara, Kenichi Morita, Shigenori Iwata
1989 J jnl
An extended syllogistic system with conjunctive and complementary terms, and its completeness proof.
Syst. Comput. Jpn.
Noritaka Nishihara, Kenichi Morita
1989 J jnl
Context-sensitivity of Two-Dimensional Regular Array Grammars.
Int. J. Pattern Recognit. Artif. Intell.
Yasunori Yamamoto, Kenichi Morita, Kazuhiro Sugata
1989 — ch.
Context-sensitivity of Two-Dimensional Regular Array Grammars.
Array Grammars, Patterns and Recognizers
Yasunori Yamamoto, Kenichi Morita, Kazuhiro Sugata
1989 J jnl
Two-Dimensional Three-Way Array Grammars and their Acceptors.
Int. J. Pattern Recognit. Artif. Intell.
Kenichi Morita, Yasunori Yamamoto, Kazuhiro Sugata
1989 — ch.
Two-Dimensional Three-Way Array Grammars and their Acceptors.
Array Grammars, Patterns and Recognizers
Kenichi Morita, Yasunori Yamamoto, Kazuhiro Sugata
1988 J jnl
An efficient reasoning method for syllogism and its application to knowledge processing.
Syst. Comput. Jpn.
Kenichi Morita, Noritaka Nishihara, Eriko Emura
1986 J jnl
On two-dimensional pattern-matching languages and their decision problems.
Inf. Sci.
Kenichi Morita, Kaoru Nakazono, Kazuhiro Sugata
1983 J jnl
The complexity of some decision problems about two-dimensional array grammars.
Inf. Sci.
Kenichi Morita, Yasunori Yamamoto, Kazuhiro Sugata
1982 J jnl
Deterministic One-Way Simulation of Two-Way Real-Time Cellular Automata and Its Related Problems.
Inf. Process. Lett.
Hiroshi Umeo, Kenichi Morita, Kazuhiro Sugata