Kenichi Morita

According to our database1, Kenichi Morita
  • authored at least 110 papers between 1982 and 2017.
  • has a "Dijkstra number"2 of five.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2017
Theory of Reversible Computing
Monographs in Theoretical Computer Science. An EATCS Series, Springer, ISBN: 978-4-431-56604-5, 2017

2016
An 8-State Simple Reversible Triangular Cellular Automaton that Exhibits Complex Behavior.
Proceedings of the Cellular Automata and Discrete Complex Systems, 2016

Universality of 8-State Reversible and Conservative Triangular Partitioned Cellular Automata.
Proceedings of the Cellular Automata, 2016

2015
General design of reversible sequential machines based on reversible logic elements.
Theor. Comput. Sci., 2015

Universal Reversible Turing Machines with a Small Number of Tape Symbols.
Fundam. Inform., 2015

2014
Universality Problems on Reversible Logic Elements with 1-Bit Memory.
IJUC, 2014

Reversibility in space-bounded computation.
Int. J. General Systems, 2014

Compact Realization of Reversible Turing Machines by 2-State Reversible Logic Elements.
Proceedings of the Unconventional Computation and Natural Computation, 2014

Reversible Turing machines with a small number of states.
Proceedings of the Sixth Workshop on Non-Classical Models for Automata and Applications, 2014

How Can We Construct Reversible Machines Out of Reversible Logic Element with Memory?
Proceedings of the Computing with New Resources, 2014

Language Recognition by Reversible Partitioned Cellular Automata.
Proceedings of the Cellular Automata and Discrete Complex Systems, 2014

2013
Brownian Circuits: Fundamentals.
JETC, 2013

Generalized Chat Noir is PSPACE-Complete.
IEICE Transactions, 2013

Reversible Logic Elements with Memory and Their Universality.
Proceedings of the Proceedings Machines, Computations and Universality 2013, 2013

2012
Reversible Cellular Automata.
Proceedings of the Handbook of Natural Computing, 2012

Design of 1-tape 2-symbol reversible Turing machines based on reversible logic elements.
Theor. Comput. Sci., 2012

Editorial for special issue on unconventional computation.
Natural Computing, 2012

Sequential and maximally parallel multiset rewriting: reversibility and determinism.
Natural Computing, 2012

Non-degenerate 2-State Reversible Logic Elements with Three or More Symbols Are All Universal.
Multiple-Valued Logic and Soft Computing, 2012

Lower Bound of Face Guards of Polyhedral Terrains.
JIP, 2012

Realizing Reversible Logic Elements with Memory in the Billiard Ball Model.
IJUC, 2012

Computation in reversible cellular automata.
Int. J. General Systems, 2012

Generalized Shisen-Sho is NP-Complete.
IEICE Transactions, 2012

Finding the Minimum Number of Face Guards is NP-Hard.
IEICE Transactions, 2012

Universality of One-Dimensional Reversible and Number-Conserving Cellular Automata
Proceedings of the Proceedings 18th international workshop on Cellular Automata and Discrete Complex Systems and 3rd international symposium Journées Automates Cellulaires, 2012

A Polynomial-Time Reduction from the 3SAT Problem to the Generalized String Puzzle Problem.
Algorithms, 2012

A Deterministic Two-Way Multi-head Finite Automaton Can Be Converted into a Reversible One with the Same Number of Heads.
Proceedings of the Reversible Computation, 4th International Workshop, 2012

Reversible Computing Systems, Logic Circuits, and Cellular Automata.
Proceedings of the Third International Conference on Networking and Computing, 2012

Computational Complexity of String Puzzles.
Proceedings of the Eighteenth Computing: The Australasian Theory Symposium, 2012

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

Two-Way Reversible Multi-Head Finite Automata.
Fundam. Inform., 2011

Design of Reversible and Quantum Circuits (Dagstuhl Seminar 11502).
Dagstuhl Reports, 2011

2010
NP-Hard and k-EXPSPACE-Hard Cast Puzzles.
IEICE Transactions, 2010

Universality Issues in Reversible Computing Systems and Cellular Automata (Extended Abstract).
Electr. Notes Theor. Comput. Sci., 2010

Majority Adder Implementation by Competing Patterns in Life-Like Rule B2/S2345.
Proceedings of the Unconventional Computation - 9th International Conference, 2010

Reversibility and Determinism in Sequential Multiset Rewriting.
Proceedings of the Unconventional Computation - 9th International Conference, 2010

Computation with competing patterns in Life-like automaton.
Proceedings of the 2010 International Conference on High Performance Computing & Simulation, 2010

Computation with Competing Patterns in Life-Like Automaton.
Proceedings of the Game of Life Cellular Automata., 2010

2009
Reversible Computing.
Proceedings of the Encyclopedia of Complexity and Systems Science, 2009

Reversible Cellular Automata.
Proceedings of the Encyclopedia of Complexity and Systems Science, 2009

On the Non-existance of Rotation-Symmetric von Neumann Neighbor Number-Conserving Cellular Automata of Which the State Number is Less than Four.
IEICE Transactions, 2009

On Reversibility and Determinism in P Systems.
Proceedings of the Membrane Computing, 10th International Workshop, 2009

Computational Complexity of Cast Puzzles.
Proceedings of the Algorithms and Computation, 20th International Symposium, 2009

2008
Reversible computing and cellular automata - A survey.
Theor. Comput. Sci., 2008

Editorial.
J. Cellular Automata, 2008

A Recursive Padding Technique on Nondeterministic Cellular Automata.
IEICE Transactions, 2008

A 24-state universal one-dimensional reversible cellular automaton.
Proceedings of the Automata 2008: Theory and Applications of Cellular Automata, 2008

A Java based three-dimensional cellular automata simulator and its application to three-dimensional Larger than Life.
Proceedings of the Automata 2008: Theory and Applications of Cellular Automata, 2008

An Asynchronous Cellular Automaton Implementing 2-State 2-Input 2-Output Reversed-Twin Reversible Elements.
Proceedings of the Cellular Automata, 2008

Computing by Swarm Networks.
Proceedings of the Cellular Automata, 2008

2007
Simple Universal One-Dimensional Reversible Cellular Automata.
J. Cellular Automata, 2007

Translational lemmas for DLOGTIME-uniform circuits, alternating TMs, and PRAMs.
Acta Inf., 2007

A Time Hierarchy Theorem for Nondeterministic Cellular Automata.
Proceedings of the Theory and Applications of Models of Computation, 2007

A Universal Reversible Turing Machine.
Proceedings of the Machines, Computations, and Universality, 5th International Conference, 2007

Pattern Generation and Parsing by Array Grammars.
Proceedings of the Formal Models, 2007

2006
A Five-State von Neumann Neighbor Universal Hyperbolic Cellular Automaton.
J. Cellular Automata, 2006

2005
Translational Lemmas for Alternating TMs and PRAMs.
Proceedings of the Fundamentals of Computation Theory, 15th International Symposium, 2005

2004
Universal Delay-Insensitive Circuits with Bidirectional and Buffering Lines.
IEEE Trans. Computers, 2004

Nondegenerate 2-State 3-Symbol Reversible Logic Elements Are All Universal.
IJUC, 2004

Simple Universal Reversible Cellular Automata in Which Reversible Logic Elements Can Be Embedded.
IEICE Transactions, 2004

Prefix Computations on Iterative Arrays with Sequential Input/Output Mode.
IEICE Transactions, 2004

A Logically Universal Number-Conserving Cellular Automaton with a Unary Table-Lookup Function.
IEICE Transactions, 2004

Classification and Universality of Reversible Logic Elements with One-Bit Memory.
Proceedings of the Machines, Computations, and Universality, 4th International Conference, 2004

Hierarchies of DLOGTIME-Uniform Circuits.
Proceedings of the Machines, Computations, and Universality, 4th International Conference, 2004

2003
Simulation of one-dimensional cellular automata by uniquely parallel parsable grammars.
Theor. Comput. Sci., 2003

Embedding Universal Delay-Insensitive Circuits in Asynchronous Cellular Spaces.
Fundam. Inform., 2003

Simulations Between Multi-dimensional Deterministic and Alternating Cellular Automata.
Fundam. Inform., 2003

A New Universal Logic Element for Reversible Computing.
Proceedings of the Grammars and Automata for String Processing: From Mathematics and Computer Science to Biology, 2003

2002
Constructible functions in cellular automata and their applications to hierarchy results.
Theor. Comput. Sci., 2002

Firing Squad Synchronization Problem in Number-Conserving Cellular Automata.
Fundam. Inform., 2002

Self-Reproduction in Three-Dimensional Reversible Cellular Space.
Artificial Life, 2002

A quadratic speedup theorem for iterative arrays.
Acta Inf., 2002

Reversible Computation in Asynchronous Cellular Automata.
Proceedings of the Unconventional Models of Computation, Third International Conference, 2002

Embedding a Logically Universal Model and a Self-Reproducing Model into Number-Conserving Cellular Automata.
Proceedings of the Unconventional Models of Computation, Third International Conference, 2002

Computational Complexity in the Hyperbolic Plane.
Proceedings of the Mathematical Foundations of Computer Science 2002, 2002

2001
NP problems are tractable in the space of cellular automata in the hyperbolic plane.
Theor. Comput. Sci., 2001

Number-Conserving Reversible Cellular Automata and Their Computation-Universality.
ITA, 2001

A three-dimensional uniquely parsable array grammar that generates and parses cubes.
Electr. Notes Theor. Comput. Sci., 2001

A Simple Universal Logic Element and Cellular Automata for Reversible Computing.
Proceedings of the Machines, 2001

Speeding-Up Cellular Automata by Alternations.
Proceedings of the Machines, 2001

Generation and Parsing of Morphism Languages by Uniquely Parallel Parsable Grammars.
Proceedings of the Words, Semigroups, and Transductions, 2001

2000
A computation-universal two-dimensional 8-state triangular reversible cellular automaton.
Theor. Comput. Sci., 2000

Uniquely Parsable Unification Grammars and Their Parser Implemented in Prolog.
Grammars, 2000

Characterizing the Class of Deterministic Context-Free Languages by Semi-Right-Terminating Uniquely Parsable Grammars.
Proceedings of the Recent Topics in Mathematical and Computational Linguistics, 2000

1999
Uniquely parsable array grammars for generating and parsing connected patterns.
Pattern Recognition, 1999

A Polynomial Solution for 3-SAT in the Space of Cellular Automata in the Hyperbolic Plane.
J. UCS, 1999

Universality of Reversible Hexagonal Cellular Automata.
ITA, 1999

Characterizing the Ability of Parallel Array Generators on Reversible Partitioned Cellular Automata.
IJPRAI, 1999

On Time-Constructible Functions in One-Dimensional Cellular Automata.
Proceedings of the Fundamentals of Computation Theory, 12th International Symposium, 1999

1998
A computation-universal two-dimensional 8-state triangular reversible cellular automaton.
Proceedings of the International Colloquium Universal Machines and Computations, 1998

1997
A Hierarchy of Uniquely Parsable Grammar Classes and Deterministic Acceptors.
Acta Inf., 1997

1996
Self-Reproduction in a Reversible Cellular Space.
Theor. Comput. Sci., 1996

Universality of a Reversible Two-Counter Machine.
Theor. Comput. Sci., 1996

Firing Squad Synchronization Problem in Reversible Cellular Automata.
Theor. Comput. Sci., 1996

Logical Universality and Self-Reproduction in Reversible Cellular Automata.
Proceedings of the Evolvable Systems: From Biology to Hardware, 1996

1995
Reversible Simulation of One-Dimensional Irreversible Cellular Automata.
Theor. Comput. Sci., 1995

1994
Parallel Generation and Parsing of Array Languages Using Reversible Cellular Automata.
IJPRAI, 1994

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

Two-Dimensional Uniquely Parsable Isometric Array Grammars.
IJPRAI, 1992

Parallel Generation and Parsing of Array Languages Using Reversible Cellular Automata.
Proceedings of the Parallel Image Analysis, Second International Conference, 1992

1990
An extended syllogistic system with verbs and proper nouns, and its completeness proof.
Systems and Computers in Japan, 1990

1989
Context-sensitivity of Two-Dimensional Regular Array Grammars.
Proceedings of the Array Grammars, Patterns and Recognizers, 1989

Two-Dimensional Three-Way Array Grammars and their Acceptors.
Proceedings of the Array Grammars, Patterns and Recognizers, 1989

An extended syllogistic system with conjunctive and complementary terms, and its completeness proof.
Systems and Computers in Japan, 1989

Context-sensitivity of Two-Dimensional Regular Array Grammars.
IJPRAI, 1989

Two-Dimensional Three-Way Array Grammars and their Acceptors.
IJPRAI, 1989

1988
An efficient reasoning method for syllogism and its application to knowledge processing.
Systems and Computers in Japan, 1988

1986
On two-dimensional pattern-matching languages and their decision problems.
Inf. Sci., 1986

1983
The complexity of some decision problems about two-dimensional array grammars.
Inf. Sci., 1983

1982
Deterministic One-Way Simulation of Two-Way Real-Time Cellular Automata and Its Related Problems.
Inf. Process. Lett., 1982


  Loading...