Kenichi Morita

From MaRDI portal
Person:235713

Available identifiers

zbMath Open morita.kenichiWikidataQ88800136 ScholiaQ88800136MaRDI QIDQ235713

List of research outcomes

PublicationDate of PublicationType
A universal non-conservative reversible elementary triangular partitioned cellular automaton that shows complex behavior2024-02-09Paper
https://portal.mardi4nfdi.de/entity/Q61908742024-02-06Paper
Novel Reversible Logic Elements for Unconventional Computing2023-09-01Paper
Emergence of Complex Phenomena in a Simple Reversible Cellular Space2023-04-28Paper
GENERATION AND PARSING OF MORPHISM LANGUAGES BY UNIQUELY PARALLEL PARSABLE GRAMMARS2022-12-06Paper
Gliders in the game of life and in a reversible cellular automaton2022-10-25Paper
Reversible elementary triangular partitioned cellular automata and their complex behavior2022-10-25Paper
Reversible Cellular Automata2022-04-28Paper
https://portal.mardi4nfdi.de/entity/Q50615202022-03-11Paper
How Can We Construct Reversible Turing Machines in a Very Simple Reversible Cellular Automaton?2021-11-03Paper
https://portal.mardi4nfdi.de/entity/Q50103002021-08-25Paper
https://portal.mardi4nfdi.de/entity/Q50103092021-08-25Paper
An instruction set for reversible Turing machines2021-07-23Paper
https://portal.mardi4nfdi.de/entity/Q49928652021-06-10Paper
https://portal.mardi4nfdi.de/entity/Q49863122021-04-27Paper
A Snapshot of My Life2020-05-28Paper
Logical Gates via Gliders Collisions2020-05-28Paper
A polynomial-time reduction from the 3SAT problem to the generalized string puzzle problem2019-03-26Paper
Universality of 8-State Reversible and Conservative Triangular Partitioned Cellular Automata2018-07-06Paper
Theory of reversible computing2017-12-11Paper
An 8-State Simple Reversible Triangular Cellular Automaton that Exhibits Complex Behavior2016-08-10Paper
Universal Reversible Turing Machines with a Small Number of Tape Symbols2016-05-11Paper
Cellular Automata and Artificial Life2016-04-05Paper
A Deterministic Two-Way Multi-head Finite Automaton Can Be Converted into a Reversible One with the Same Number of Heads2015-11-30Paper
Compact Realization of Reversible Turing Machines by 2-State Reversible Logic Elements2015-09-14Paper
How Can We Construct Reversible Machines Out of Reversible Logic Element with Memory?2015-09-08Paper
Language Recognition by Reversible Partitioned Cellular Automata2015-08-04Paper
Constructing Reversible Turing Machines by Reversible Logic Element with Memory2015-04-14Paper
General design of reversible sequential machines based on reversible logic elements2015-01-28Paper
Reversibility in space-bounded computation2014-11-19Paper
Computation in reversible cellular automata2014-01-06Paper
A Three-Dimensional Uniquely Parsable Array Grammar that Generates and Parses Cubes2013-04-26Paper
Design of 1-tape 2-symbol reversible Turing machines based on reversible logic elements2012-11-27Paper
Sequential and maximally parallel multiset rewriting: reversibility and determinism2012-11-15Paper
https://portal.mardi4nfdi.de/entity/Q53893322012-04-26Paper
Two-Way Reversible Multi-Head Finite Automata2011-11-22Paper
Simulating reversible Turing machines and cyclic tag systems by one-dimensional reversible cellular automata2011-07-18Paper
Complexity of evolution languages of the elementary cellular automaton of rule 1462011-01-29Paper
Reversibility and Determinism in Sequential Multiset Rewriting2010-07-26Paper
Majority Adder Implementation by Competing Patterns in Life-Like Rule B2/S23452010-07-26Paper
On Reversibility and Determinism in P Systems2010-01-26Paper
Computational Complexity of Cast Puzzles2009-12-17Paper
A Universal Reversible Turing Machine2009-03-05Paper
Computing by Swarm Networks2008-11-27Paper
An Asynchronous Cellular Automaton Implementing 2-State 2-Input 2-Output Reversed-Twin Reversible Elements2008-11-27Paper
Reversible computing and cellular automata -- a survey2008-05-19Paper
https://portal.mardi4nfdi.de/entity/Q54464082008-03-06Paper
https://portal.mardi4nfdi.de/entity/Q54467152008-03-06Paper
A Time Hierarchy Theorem for Nondeterministic Cellular Automata2007-11-13Paper
Translational lemmas for DLOGTIME-uniform circuits, alternating TMs, and PRAMs2007-09-10Paper
Fundamentals of Computation Theory2006-10-20Paper
Machines, Computations, and Universality2005-12-08Paper
Machines, Computations, and Universality2005-12-08Paper
https://portal.mardi4nfdi.de/entity/Q46628422005-03-30Paper
Asynchronous game of life2004-11-22Paper
https://portal.mardi4nfdi.de/entity/Q48256772004-11-05Paper
https://portal.mardi4nfdi.de/entity/Q48256792004-11-05Paper
https://portal.mardi4nfdi.de/entity/Q44532182004-03-07Paper
https://portal.mardi4nfdi.de/entity/Q44370942003-12-07Paper
https://portal.mardi4nfdi.de/entity/Q44371002003-12-07Paper
A quadratic speedup theorem for iterative arrays2003-09-01Paper
Simulation of one-dimensional cellular automata by uniquely parallel parsable grammars.2003-08-17Paper
Number-Conserving Reversible Cellular Automata and Their Computation-Universality2003-07-28Paper
https://portal.mardi4nfdi.de/entity/Q47085852003-06-18Paper
https://portal.mardi4nfdi.de/entity/Q47993682003-06-12Paper
https://portal.mardi4nfdi.de/entity/Q45482962002-08-26Paper
https://portal.mardi4nfdi.de/entity/Q45483202002-08-26Paper
https://portal.mardi4nfdi.de/entity/Q45483332002-08-26Paper
https://portal.mardi4nfdi.de/entity/Q45443502002-08-04Paper
https://portal.mardi4nfdi.de/entity/Q45299932002-05-07Paper
https://portal.mardi4nfdi.de/entity/Q45300032002-05-07Paper
Constructible functions in cellular automata and their applications to hierarchy results2002-03-03Paper
https://portal.mardi4nfdi.de/entity/Q27438262001-09-17Paper
https://portal.mardi4nfdi.de/entity/Q27438272001-09-17Paper
NP problems are tractable in the space of cellular automata in the hyperbolic plane2001-08-20Paper
Uniquely parsable unification grammars and their parser implemented in Prolog2001-06-21Paper
https://portal.mardi4nfdi.de/entity/Q45207822001-02-27Paper
https://portal.mardi4nfdi.de/entity/Q45053652000-09-27Paper
https://portal.mardi4nfdi.de/entity/Q45053662000-09-27Paper
https://portal.mardi4nfdi.de/entity/Q45053682000-09-27Paper
A computation-universal two-dimensional 8-state triangular reversible cellular automaton2000-08-23Paper
Universality of Reversible Hexagonal Cellular Automata2000-05-09Paper
https://portal.mardi4nfdi.de/entity/Q49378682000-02-20Paper
https://portal.mardi4nfdi.de/entity/Q49372102000-02-03Paper
https://portal.mardi4nfdi.de/entity/Q49372272000-02-03Paper
https://portal.mardi4nfdi.de/entity/Q49343402000-01-17Paper
https://portal.mardi4nfdi.de/entity/Q47038631999-12-01Paper
Reversible simulation of one-dimensional irreversible cellular automata1997-02-28Paper
Firing squad synchronization problem in reversible cellular automata1997-02-27Paper
Universality of a reversible two-counter machine1997-02-27Paper
Self-reproduction in a reversible cellular space1997-02-27Paper
A hierarchy of uniquely parsable grammar classes and deterministic acceptors1996-09-25Paper
Computation-universality of one-dimensional one-way reversible cellular automata1993-01-16Paper
On two-dimensional pattern-matching languages and their decision problems1986-01-01Paper
The complexity of some decision problems about two-dimensional array grammars1983-01-01Paper
Deterministic one-way simulation of two-way real-time cellular automata and its related problems1982-01-01Paper

Research outcomes over time


Doctoral students

No records found.


Known relations from the MaRDI Knowledge Graph

PropertyValue
MaRDI profile typeMaRDI person profile
instance ofhuman


This page was built for person: Kenichi Morita