Kenichi Morita
Orcid: 0000-0002-9833-0539
According to our database1,
Kenichi Morita
authored at least 131 papers
between 1982 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on zbmath.org
-
on orcid.org
-
on d-nb.info
On csauthors.net:
Bibliography
2024
Proceedings of the Cellular Automata Technology - Third Asian Symposium, 2024
2023
Bull. EATCS, 2023
2022
Time-reversal symmetries in two-dimensional reversible partitioned cellular automata and their applications.
Int. J. Parallel Emergent Distributed Syst., 2022
Int. J. Parallel Emergent Distributed Syst., 2022
Efficient and Accurate Skeleton-Based Two-Person Interaction Recognition Using Inter-and Intra-Body Graphs.
Proceedings of the 2022 IEEE International Conference on Image Processing, 2022
Reversible Elementary Triangular Partitioned Cellular Automata and Their Complex Behavior.
Proceedings of the Automata and Complexity, 2022
Proceedings of First Asian Symposium on Cellular Automata Technology, 2022
2021
Constructing Reversible Turing Machines in a Reversible and Conservative Elementary Triangular Cellular Automaton.
J. Autom. Lang. Comb., 2021
Multi-Stream Adaptive Graph Convolutional Network Using Inter- and Intra-Body Graphs for Two-Person Interaction Recognition.
IEEE Access, 2021
How Can We Construct Reversible Turing Machines in a Very Simple Reversible Cellular Automaton?
Proceedings of the Reversible Computation - 13th International Conference, 2021
2019
A universal non-conservative reversible elementary triangular partitioned cellular automaton that shows complex behavior.
Nat. Comput., 2019
2018
Language Recognition by Reversible Partitioned Cellular Automata and Iterative Arrays.
J. Cell. Autom., 2018
J. Cell. Autom., 2018
Proceedings of the Reversibility and Universality, 2018
2017
Monographs in Theoretical Computer Science. An EATCS Series, Springer, ISBN: 978-4-431-56604-5, 2017
Int. J. Unconv. Comput., 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
Theor. Comput. Sci., 2015
Fundam. Informaticae, 2015
2014
Int. J. Unconv. Comput., 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
Proceedings of the Cellular Automata and Discrete Complex Systems, 2014
2013
Proceedings of the Proceedings Machines, Computations and Universality 2013, 2013
2012
Design of 1-tape 2-symbol reversible Turing machines based on reversible logic elements.
Theor. Comput. Sci., 2012
Nat. Comput., 2012
Non-degenerate 2-State Reversible Logic Elements with Three or More Symbols Are All Universal.
J. Multiple Valued Log. Soft Comput., 2012
Int. J. Unconv. Comput., 2012
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
Proceedings of the Third International Conference on Networking and Computing, 2012
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
Dagstuhl Reports, 2011
2010
Majority Adder Implementation by Competing Patterns in Life-Like Rule <i>B</i>2/<i>S</i>2345.
Proceedings of the Unconventional Computation - 9th International Conference, 2010
Proceedings of the Unconventional Computation - 9th International Conference, 2010
Proceedings of the 2010 International Conference on High Performance Computing & Simulation, 2010
Proceedings of the Game of Life Cellular Automata., 2010
2009
Proceedings of the Encyclopedia of Complexity and Systems Science, 2009
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 Trans. Inf. Syst., 2009
Universality Issues in Reversible Computing Systems and Cellular Automata (Extended Abstract).
Proceedings of the Workshop on Reversible Computation, 2009
Proceedings of the Membrane Computing, 10th International Workshop, 2009
Universality of 2-State 3-Symbol Reversible Logic Elements - A Direct Simulation Method of a Rotary Element.
Proceedings of the Natural Computing - 4th International Workshop on Natural Computing, 2009
Proceedings of the Natural Computing - 4th International Workshop on Natural Computing, 2009
Proceedings of the Algorithms and Computation, 20th International Symposium, 2009
2008
Editorial.
J. Cell. Autom., 2008
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 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
2007
Acta Informatica, 2007
Proceedings of the Theory and Applications of Models of Computation, 2007
Proceedings of the Machines, Computations, and Universality, 5th International Conference, 2007
Proceedings of the Formal Models, 2007
2006
J. Cell. Autom., 2006
2005
Proceedings of the Fundamentals of Computation Theory, 15th International Symposium, 2005
2004
IEEE Trans. Computers, 2004
Int. J. Unconv. Comput., 2004
Simple Universal Reversible Cellular Automata in Which Reversible Logic Elements Can Be Embedded.
IEICE Trans. Inf. Syst., 2004
IEICE Trans. Inf. Syst., 2004
A Logically Universal Number-Conserving Cellular Automaton with a Unary Table-Lookup Function.
IEICE Trans. Inf. Syst., 2004
Proceedings of the Machines, Computations, and Universality, 4th International Conference, 2004
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
Fundam. Informaticae, 2003
Simulations Between Multi-dimensional Deterministic and Alternating Cellular Automata.
Fundam. Informaticae, 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
Fundam. Informaticae, 2002
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
Proceedings of the Mathematical Foundations of Computer Science 2002, 2002
Universal Computing in Reversible and Number-Conserving Two-Dimensional Cellular Spaces.
Proceedings of the Collision-Based Computing, 2002
2001
Theor. Comput. Sci., 2001
RAIRO Theor. Informatics Appl., 2001
Proceedings of the 8th International Workshop on Combinatorial Image Analysis, 2001
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
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
Pattern Recognit., 1999
A Polynomial Solution for 3-SAT in the Space of Cellular Automata in the Hyperbolic Plane.
J. Univers. Comput. Sci., 1999
RAIRO Theor. Informatics Appl., 1999
Characterizing the Ability of Parallel Array Generators on Reversible Partitioned Cellular Automata.
Int. J. Pattern Recognit. Artif. Intell., 1999
Proceedings of the Fundamentals of Computation Theory, 12th International Symposium, 1999
1997
Acta Informatica, 1997
1996
Theor. Comput. Sci., 1996
Proceedings of the Evolvable Systems: From Biology to Hardware, 1996
1995
Theor. Comput. Sci., 1995
1994
Parallel Generation and Parsing of Array Languages Using Reversible Cellular Automata.
Int. J. Pattern Recognit. Artif. Intell., 1994
1992
Inf. Process. Lett., 1992
Int. J. Pattern Recognit. Artif. Intell., 1992
1990
An extended syllogistic system with verbs and proper nouns, and its completeness proof.
Syst. Comput. Jpn., 1990
1989
Proceedings of the Array Grammars, Patterns and Recognizers, 1989
Proceedings of the Array Grammars, Patterns and Recognizers, 1989
An extended syllogistic system with conjunctive and complementary terms, and its completeness proof.
Syst. Comput. Jpn., 1989
Int. J. Pattern Recognit. Artif. Intell., 1989
Int. J. Pattern Recognit. Artif. Intell., 1989
1988
An efficient reasoning method for syllogism and its application to knowledge processing.
Syst. Comput. Jpn., 1988
1986
Inf. Sci., 1986
1983
Inf. Sci., 1983
1982
Deterministic One-Way Simulation of Two-Way Real-Time Cellular Automata and Its Related Problems.
Inf. Process. Lett., 1982