Deterministic One-Way Simulation of Two-Way Real-Time Cellular Automata and Its Related Problems. - Hiroshi Umeo; Kenichi Morita; Kazuhiro Sugata (Inf. Process. Lett., 1982)

The complexity of some decision problems about two-dimensional array grammars. - Kenichi Morita; Yasunori Yamamoto; Kazuhiro Sugata (Inf. Sci., 1983)

On two-dimensional pattern-matching languages and their decision problems. - Kenichi Morita; Kaoru Nakazono; Kazuhiro Sugata (Inf. Sci., 1986)

An efficient reasoning method for syllogism and its application to knowledge processing. - Kenichi Morita; Noritaka Nishihara; Eriko Emura (Syst. Comput. Jpn., 1988)

Two-Dimensional Three-Way Array Grammars and their Acceptors. - Kenichi Morita; Yasunori Yamamoto; Kazuhiro Sugata (Int. J. Pattern Recognit. Artif. Intell., 1989)

Context-sensitivity of Two-Dimensional Regular Array Grammars. - Yasunori Yamamoto; Kenichi Morita; Kazuhiro Sugata (Int. J. Pattern Recognit. Artif. Intell., 1989)

An extended syllogistic system with conjunctive and complementary terms, and its completeness proof. - Noritaka Nishihara; Kenichi Morita (Syst. Comput. Jpn., 1989)

Two-Dimensional Three-Way Array Grammars and their Acceptors. - Kenichi Morita; Yasunori Yamamoto; Kazuhiro Sugata (Array Grammars, Patterns and Recognizers, 1989)

Context-sensitivity of Two-Dimensional Regular Array Grammars. - Yasunori Yamamoto; Kenichi Morita; Kazuhiro Sugata (Array Grammars, Patterns and Recognizers, 1989)

An extended syllogistic system with verbs and proper nouns, and its completeness proof. - Noritaka Nishihara; Kenichi Morita; Shigenori Iwata (Syst. Comput. Jpn., 1990)

Two-Dimensional Uniquely Parsable Isometric Array Grammars. - Yasunori Yamamoto; Kenichi Morita (Int. J. Pattern Recognit. Artif. Intell., 1992)

Computation-Universality of One-Dimensional One-Way Reversible Cellular Automata. - Kenichi Morita (Inf. Process. Lett., 1992)

Parallel Generation and Parsing of Array Languages Using Reversible Cellular Automata. - Kenichi Morita; Satoshi Ueno (Int. J. Pattern Recognit. Artif. Intell., 1994)

Reversible Simulation of One-Dimensional Irreversible Cellular Automata. - Kenichi Morita (Theor. Comput. Sci., 1995)

Logical Universality and Self-Reproduction in Reversible Cellular Automata. - Kenichi Morita; Katsunobu Imai (ICES, 1996)

Firing Squad Synchronization Problem in Reversible Cellular Automata. - Katsunobu Imai; Kenichi Morita (Theor. Comput. Sci., 1996)

Universality of a Reversible Two-Counter Machine. - Kenichi Morita (Theor. Comput. Sci., 1996)

Self-Reproduction in a Reversible Cellular Space. - Kenichi Morita; Katsunobu Imai (Theor. Comput. Sci., 1996)

A Hierarchy of Uniquely Parsable Grammar Classes and Deterministic Acceptors. - Kenichi Morita; Noritaka Nishihara; Yasunori Yamamoto; Zhiguo Zhang (Acta Informatica, 1997)

On Time-Constructible Functions in One-Dimensional Cellular Automata. - Chuzo Iwamoto; Tomonobu Hatsuyama; Kenichi Morita; Katsunobu Imai (FCT, 1999)

Characterizing the Ability of Parallel Array Generators on Reversible Partitioned Cellular Automata. - Kenichi Morita; Satoshi Ueno; Katsunobu Imai (Int. J. Pattern Recognit. Artif. Intell., 1999)

Universality of Reversible Hexagonal Cellular Automata. - Kenichi Morita; Maurice Margenstern; Katsunobu Imai (RAIRO Theor. Informatics Appl., 1999)

A Polynomial Solution for 3-SAT in the Space of Cellular Automata in the Hyperbolic Plane. - Maurice Margenstern; Kenichi Morita (J. Univers. Comput. Sci., 1999)

Uniquely parsable array grammars for generating and parsing connected patterns. - Kenichi Morita; Katsunobu Imai (Pattern Recognit., 1999)

Characterizing the Class of Deterministic Context-Free Languages by Semi-Right-Terminating Uniquely Parsable Grammars. - Kenichi Morita; Jia Lee (Recent Topics in Mathematical and Computational Linguistics, 2000)

Uniquely Parsable Unification Grammars and Their Parser Implemented in Prolog. - Jia Lee; Kenichi Morita; Hiroki Asou; Katsunobu Imai (Grammars, 2000)

A computation-universal two-dimensional 8-state triangular reversible cellular automaton. - Katsunobu Imai; Kenichi Morita (Theor. Comput. Sci., 2000)

Generation and Parsing of Morphism Languages by Uniquely Parallel Parsable Grammars. - Jia Lee; Kenichi Morita (Words, Semigroups, and Transductions, 2001)

Speeding-Up Cellular Automata by Alternations. - Chuzo Iwamoto; Katsuyuki Tateishi; Kenichi Morita; Katsunobu Imai (MCU, 2001)

A Simple Universal Logic Element and Cellular Automata for Reversible Computing. - Kenichi Morita (MCU, 2001)

A three-dimensional uniquely parsable array grammar that generates and parses cubes. - Katsunobu Imai; Yukio Matsuda; Chuzo Iwamoto; Kenichi Morita (IWCIA, 2001)

Number-Conserving Reversible Cellular Automata and Their Computation-Universality. - Kenichi Morita; Katsunobu Imai (RAIRO Theor. Informatics Appl., 2001)

NP problems are tractable in the space of cellular automata in the hyperbolic plane. - Maurice Margenstern; Kenichi Morita (Theor. Comput. Sci., 2001)

Universal Computing in Reversible and Number-Conserving Two-Dimensional Cellular Spaces. - Kenichi Morita; Yasuyuki Tojima; Katsunobu Imai; Tsuyoshi Ogiro (Collision-Based Computing, 2002)

Computational Complexity in the Hyperbolic Plane. - Chuzo Iwamoto; Takeshi Andou; Kenichi Morita; Katsunobu Imai (MFCS, 2002)

Embedding a Logically Universal Model and a Self-Reproducing Model into Number-Conserving Cellular Automata. - Katsunobu Imai; Kenji Fujita; Chuzo Iwamoto; Kenichi Morita (UMC, 2002)

Reversible Computation in Asynchronous Cellular Automata. - Jia Lee; Ferdinand Peper; Susumu Adachi; Kenichi Morita; Shinro Mashiko (UMC, 2002)

A quadratic speedup theorem for iterative arrays. - Chuzo Iwamoto; Katsuyuki Tateishi; Kenichi Morita; Katsunobu Imai (Acta Informatica, 2002)

Self-Reproduction in Three-Dimensional Reversible Cellular Space. - Katsunobu Imai; Takahiro Hori; Kenichi Morita (Artif. Life, 2002)

Firing Squad Synchronization Problem in Number-Conserving Cellular Automata. - Katsunobu Imai; Kenichi Morita; Kenji Sako (Fundam. Informaticae, 2002)

Constructible functions in cellular automata and their applications to hierarchy results. - Chuzo Iwamoto; Tomonobu Hatsuyama; Kenichi Morita; Katsunobu Imai (Theor. Comput. Sci., 2002)

A New Universal Logic Element for Reversible Computing. - Kenichi Morita (Grammars and Automata for String Processing, 2003)

Simulations Between Multi-dimensional Deterministic and Alternating Cellular Automata. - Chuzo Iwamoto; Katsuyuki Tateishi; Kenichi Morita; Katsunobu Imai (Fundam. Informaticae, 2003)

Embedding Universal Delay-Insensitive Circuits in Asynchronous Cellular Spaces. - Jia Lee; Susumu Adachi; Ferdinand Peper; Kenichi Morita (Fundam. Informaticae, 2003)

Simulation of one-dimensional cellular automata by uniquely parallel parsable grammars. - Jia Lee; Katsunobu Imai; Kenichi Morita (Theor. Comput. Sci., 2003)

Hierarchies of DLOGTIME-Uniform Circuits. - Chuzo Iwamoto; Naoki Hatayama; Kenichi Morita; Katsunobu Imai; Daisuke Wakamatsu (MCU, 2004)

Classification and Universality of Reversible Logic Elements with One-Bit Memory. - Kenichi Morita; Tsuyoshi Ogiro; Keiji Tanaka; Hiroko Kato (MCU, 2004)

A Logically Universal Number-Conserving Cellular Automaton with a Unary Table-Lookup Function. - Katsunobu Imai; Akihiko Ikazaki; Chuzo Iwamoto; Kenichi Morita (IEICE Trans. Inf. Syst., 2004)

Prefix Computations on Iterative Arrays with Sequential Input/Output Mode. - Chuzo Iwamoto; Tomoka Yokouchi; Kenichi Morita; Katsunobu Imai (IEICE Trans. Inf. Syst., 2004)

Simple Universal Reversible Cellular Automata in Which Reversible Logic Elements Can Be Embedded. - Kenichi Morita; Tsuyoshi Ogiro (IEICE Trans. Inf. Syst., 2004)

Nondegenerate 2-State 3-Symbol Reversible Logic Elements Are All Universal. - Tsuyoshi Ogiro; Atsushi Kanno; Keiji Tanaka; Hiroko Kato; Kenichi Morita (Int. J. Unconv. Comput., 2004)

Universal Delay-Insensitive Circuits with Bidirectional and Buffering Lines. - Jia Lee; Ferdinand Peper; Susumu Adachi; Kenichi Morita (IEEE Trans. Computers, 2004)

Translational Lemmas for Alternating TMs and PRAMs. - Chuzo Iwamoto; Yoshiaki Nakashiba; Kenichi Morita; Katsunobu Imai (FCT, 2005)

A Five-State von Neumann Neighbor Universal Hyperbolic Cellular Automaton. - Katsunobu Imai; Chuzo Iwamoto; Kenichi Morita (J. Cell. Autom., 2006)

Pattern Generation and Parsing by Array Grammars. - Kenichi Morita; Jin-Shan Qi; Katsunobu Imai (Formal Models, Languages and Applications, 2007)

A Universal Reversible Turing Machine. - Kenichi Morita; Yoshikazu Yamaguchi (MCU, 2007)

A Time Hierarchy Theorem for Nondeterministic Cellular Automata. - Chuzo Iwamoto; Harumasa Yoneda; Kenichi Morita; Katsunobu Imai (TAMC, 2007)

Translational lemmas for DLOGTIME-uniform circuits, alternating TMs, and PRAMs. - Chuzo Iwamoto; Naoki Hatayama; Yoshiaki Nakashiba; Kenichi Morita; Katsunobu Imai (Acta Informatica, 2007)

Simple Universal One-Dimensional Reversible Cellular Automata. - Kenichi Morita (J. Cell. Autom., 2007)

Computing by Swarm Networks. - Teijiro Isokawa; Ferdinand Peper; Masahiko Mitsui; Jian-Qin Liu; Kenichi Morita; Hiroshi Umeo; Naotake Kamiura; Nobuyuki Matsui (ACRI, 2008)

An Asynchronous Cellular Automaton Implementing 2-State 2-Input 2-Output Reversed-Twin Reversible Elements. - Jia Lee; Ferdinand Peper; Susumu Adachi; Kenichi Morita (ACRI, 2008)

A Java based three-dimensional cellular automata simulator and its application to three-dimensional Larger than Life. - Mitsuru Matsushima; Katsunobu Imai; Chuzo Iwamoto; Kenichi Morita (Automata, 2008)

A 24-state universal one-dimensional reversible cellular automaton. - Kenichi Morita (Automata, 2008)

A Recursive Padding Technique on Nondeterministic Cellular Automata. - Chuzo Iwamoto; Harumasa Yoneda; Kenichi Morita; Katsunobu Imai (IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2008)

Editorial. - Kenichi Morita (J. Cell. Autom., 2008)

Reversible computing and cellular automata - A survey. - Kenichi Morita (Theor. Comput. Sci., 2008)

Computational Complexity of Cast Puzzles. - Chuzo Iwamoto; Kento Sasaki; Kenji Nishio; Kenichi Morita (ISAAC, 2009)

On Designing Gliders in Three-Dimensional Larger than Life Cellular Automata. - Katsunobu Imai; Yasuaki Masamori; Chuzo Iwamoto; Kenichi Morita (IWNC, 2009)

Universality of 2-State 3-Symbol Reversible Logic Elements - A Direct Simulation Method of a Rotary Element. - Tsuyoshi Ogiro; Artiom Alhazov; Tsuyoshi Tanizawa; Kenichi Morita (IWNC, 2009)

On Reversibility and Determinism in P Systems. - Artiom Alhazov; Kenichi Morita (Workshop on Membrane Computing, 2009)

Universality Issues in Reversible Computing Systems and Cellular Automata (Extended Abstract). - Kenichi Morita (RC@ETAPS, 2009)

On the Non-existance of Rotation-Symmetric von Neumann Neighbor Number-Conserving Cellular Automata of Which the State Number is Less than Four. - Naonori Tanimoto; Katsunobu Imai; Chuzo Iwamoto; Kenichi Morita (IEICE Trans. Inf. Syst., 2009)

Reversible Cellular Automata. - Kenichi Morita (Encyclopedia of Complexity and Systems Science, 2009)

Reversible Computing. - Kenichi Morita (Encyclopedia of Complexity and Systems Science, 2009)

Computation with Competing Patterns in Life-Like Automaton. - Genaro J. Martínez; Andrew Adamatzky; Kenichi Morita; Maurice Margenstern (Game of Life Cellular Automata, 2010)

Computation with competing patterns in Life-like automaton. - Genaro Juárez Martínez; Andrew Adamatzky; Kenichi Morita; Maurice Margenstern (HPCS, 2010)

Reversibility and Determinism in Sequential Multiset Rewriting. - Artiom Alhazov; Rudolf Freund; Kenichi Morita (UC, 2010)

Majority Adder Implementation by Competing Patterns in Life-Like Rule B2/S2345. - Genaro Juárez Martínez; Kenichi Morita; Andrew Adamatzky; Maurice Margenstern (UC, 2010)

NP-Hard and k-EXPSPACE-Hard Cast Puzzles. - Chuzo Iwamoto; Kento Sasaki; Kenji Nishio; Kenichi Morita (IEICE Trans. Inf. Syst., 2010)

Design of Reversible and Quantum Circuits (Dagstuhl Seminar 11502). - Kenichi Morita; Robert Wille (Dagstuhl Reports, 2011)

Two-Way Reversible Multi-Head Finite Automata. - Kenichi Morita (Fundam. Informaticae, 2011)

Simulating reversible Turing machines and cyclic tag systems by one-dimensional reversible cellular automata. - Kenichi Morita (Theor. Comput. Sci., 2011)

Computational Complexity of String Puzzles. - Chuzo Iwamoto; Kento Sasaki; Kenichi Morita (CATS, 2012)

Reversible Computing Systems, Logic Circuits, and Cellular Automata. - Kenichi Morita (ICNC, 2012)

A Deterministic Two-Way Multi-head Finite Automaton Can Be Converted into a Reversible One with the Same Number of Heads. - Kenichi Morita (RC, 2012)

A Polynomial-Time Reduction from the 3SAT Problem to the Generalized String Puzzle Problem. - Chuzo Iwamoto; Kento Sasaki; Kenichi Morita (Algorithms, 2012)

Universality of One-Dimensional Reversible and Number-Conserving Cellular Automata - Kenichi Morita (AUTOMATA & JAC, 2012)

Finding the Minimum Number of Face Guards is NP-Hard. - Chuzo Iwamoto; Yusuke Kitagaki; Kenichi Morita (IEICE Trans. Inf. Syst., 2012)

Generalized Shisen-Sho is NP-Complete. - Chuzo Iwamoto; Yoshihiro Wada; Kenichi Morita (IEICE Trans. Inf. Syst., 2012)

Computation in reversible cellular automata. - Kenichi Morita (Int. J. Gen. Syst., 2012)

Realizing Reversible Logic Elements with Memory in the Billiard Ball Model. - Yuta Mukai; Kenichi Morita (Int. J. Unconv. Comput., 2012)

Lower Bound of Face Guards of Polyhedral Terrains. - Chuzo Iwamoto; Junichi Kishi; Kenichi Morita (J. Inf. Process., 2012)

Non-degenerate 2-State Reversible Logic Elements with Three or More Symbols Are All Universal. - Kenichi Morita; Tsuyoshi Ogiro; Artiom Alhazov (J. Multiple Valued Log. Soft Comput., 2012)

Sequential and maximally parallel multiset rewriting: reversibility and determinism. - Artiom Alhazov; Rudolf Freund; Kenichi Morita (Nat. Comput., 2012)

Editorial for special issue on unconventional computation. - Jon Timmis; Kenichi Morita (Nat. Comput., 2012)

Design of 1-tape 2-symbol reversible Turing machines based on reversible logic elements. - Jia Lee; Rui-Long Yang; Kenichi Morita (Theor. Comput. Sci., 2012)

Reversible Cellular Automata. - Kenichi Morita (Handbook of Natural Computing, 2012)

Reversible Logic Elements with Memory and Their Universality. - Kenichi Morita (MCU, 2013)

Generalized Chat Noir is PSPACE-Complete. - Chuzo Iwamoto; Yuta Mukai; Yuichi Sumida; Kenichi Morita (IEICE Trans. Inf. Syst., 2013)

Brownian Circuits: Fundamentals. - Ferdinand Peper; Jia Lee; Josep Carmona 001; Jordi Cortadella; Kenichi Morita (ACM J. Emerg. Technol. Comput. Syst., 2013)

Language Recognition by Reversible Partitioned Cellular Automata. - Kenichi Morita (Automata, 2014)

How Can We Construct Reversible Machines Out of Reversible Logic Element with Memory? - Kenichi Morita; Tsuyoshi Ogiro (Computing with New Resources, 2014)

Reversible Turing machines with a small number of states. - Kenichi Morita (NCMA, 2014)

Compact Realization of Reversible Turing Machines by 2-State Reversible Logic Elements. - Kenichi Morita; Rei Suyama (UCNC, 2014)

Reversibility in space-bounded computation. - Kenichi Morita (Int. J. Gen. Syst., 2014)

Universality Problems on Reversible Logic Elements with 1-Bit Memory. - Yuta Mukai; Tsuyoshi Ogiro; Kenichi Morita (Int. J. Unconv. Comput., 2014)

Universal Reversible Turing Machines with a Small Number of Tape Symbols. - Kenichi Morita (Fundam. Informaticae, 2015)

General design of reversible sequential machines based on reversible logic elements. - Ming-Xiao Tang; Jia Lee; Kenichi Morita (Theor. Comput. Sci., 2015)

Universality of 8-State Reversible and Conservative Triangular Partitioned Cellular Automata. - Kenichi Morita (ACRI, 2016)

An 8-State Simple Reversible Triangular Cellular Automaton that Exhibits Complex Behavior. - Kenichi Morita (Automata, 2016)

Finding a Pathway from Reversible Microscopic Laws to Reversible Computers. - Kenichi Morita (Int. J. Unconv. Comput., 2017)

Theory of Reversible Computing - Kenichi Morita (Springer, 2017)

Logical Gates via Gliders Collisions. - Genaro J. Martínez; Andrew Adamatzky; Kenichi Morita (Reversibility and Universality, 2018)

A Snapshot of My Life. - Kenichi Morita (Reversibility and Universality, 2018)

Logical Gates via Gliders Collisions. - Genaro J. Martínez; Andrew Adamatzky; Kenichi Morita (CoRR, 2018)

Conservative Computing in a One-dimensional Cellular Automaton with Memory. - Genaro J. Martínez; Kenichi Morita (J. Cell. Autom., 2018)

Language Recognition by Reversible Partitioned Cellular Automata and Iterative Arrays. - Kenichi Morita (J. Cell. Autom., 2018)

Reversible Marker Automata on Two-Dimensional Tapes. - Kenichi Morita (Int. J. Unconv. Comput., 2019)

A universal non-conservative reversible elementary triangular partitioned cellular automaton that shows complex behavior. - Kenichi Morita (Nat. Comput., 2019)

How Can We Construct Reversible Turing Machines in a Very Simple Reversible Cellular Automaton? - Kenichi Morita (RC, 2021)

Multi-Stream Adaptive Graph Convolutional Network Using Inter- and Intra-Body Graphs for Two-Person Interaction Recognition. - Yoshiki Ito; Kenichi Morita; Quan Kong; Tomoaki Yoshinaga (IEEE Access, 2021)

An instruction set for reversible Turing machines. - Kenichi Morita (Acta Informatica, 2021)

On Wave-Based Majority Gates with Cellular Automata. - Genaro J. Martínez; Andrew Adamatzky; Shigeru Ninagawa; Kenichi Morita (CoRR, 2021)

Constructing Reversible Turing Machines in a Reversible and Conservative Elementary Triangular Cellular Automaton. - Kenichi Morita (J. Autom. Lang. Comb., 2021)

Computing in a Simple Reversible and Conservative Cellular Automaton. - Kenichi Morita (ASCAT, 2022)

Reversible Elementary Triangular Partitioned Cellular Automata and Their Complex Behavior. - Kenichi Morita (Automata and Complexity, 2022)

Efficient and Accurate Skeleton-Based Two-Person Interaction Recognition Using Inter-and Intra-Body Graphs. - Yoshiki Ito; Quan Kong; Kenichi Morita; Tomoaki Yoshinaga (ICIP, 2022)

Fredkin gates in simple reversible cellular automata. - Kenichi Morita (Int. J. Parallel Emergent Distributed Syst., 2022)

Time-reversal symmetries in two-dimensional reversible partitioned cellular automata and their applications. - Kenichi Morita (Int. J. Parallel Emergent Distributed Syst., 2022)

Making Reversible Computing Machines in a Reversible Cellular Space. - Kenichi Morita (Bull. EATCS, 2023)

Reversible World of Cellular Automata - Fantastic Phenomena and Computing in Artificial Reversible Universe - Kenichi Morita (Reversible World of Cellular Automata, 2024)

Making and Using a Rotary Element in Reversible Cellular Automata. - Kenichi Morita (ASCAT, 2024)

A Universal Reversible Turing Machine that Directly Simulates Reversible Counter Machines. - Kenichi Morita (Comput. Sci. J. Moldova, 2024)

Composing a Rotary Element in Simple Reversible Cellular Automata to Make Reversible Computers. - Kenichi Morita (Advances in Cellular Automata - Volume 1: Theory (1), 2025)