default search action
Kenichi Morita
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
- [b2]Kenichi Morita:
Reversible World of Cellular Automata - Fantastic Phenomena and Computing in Artificial Reversible Universe. WSPC Book Series in Unconventional Computing 4, WorldScientific 2024, ISBN 9789811280320, pp. 1-348 - [c47]Kenichi Morita
:
Making and Using a Rotary Element in Reversible Cellular Automata. ASCAT 2024: 1-16 - 2023
- [j74]Kenichi Morita:
Making Reversible Computing Machines in a Reversible Cellular Space. Bull. EATCS 140 (2023) - 2022
- [j73]Kenichi Morita
Fredkin gates in simple reversible cellular automata. Int. J. Parallel Emergent Distributed Syst. 37(3): 249-272 (2022) - [j72]Kenichi Morita
Time-reversal symmetries in two-dimensional reversible partitioned cellular automata and their applications. Int. J. Parallel Emergent Distributed Syst. 37(5): 479-511 (2022) - [c46]Kenichi Morita
Computing in a Simple Reversible and Conservative Cellular Automaton. ASCAT 2022: 3-16 - [c45]Kenichi Morita
Reversible Elementary Triangular Partitioned Cellular Automata and Their Complex Behavior. Automata and Complexity 2022: 359-381 - [c44]Yoshiki Ito, Quan Kong, Kenichi Morita, Tomoaki Yoshinaga:
Efficient and Accurate Skeleton-Based Two-Person Interaction Recognition Using Inter-and Intra-Body Graphs. ICIP 2022: 231-235 - [i4]Yoshiki Ito, Quan Kong, Kenichi Morita, Tomoaki Yoshinaga:
Efficient and Accurate Skeleton-Based Two-Person Interaction Recognition Using Inter- and Intra-body Graphs. CoRR abs/2207.12648 (2022) - 2021
- [j71]Yoshiki Ito
Multi-Stream Adaptive Graph Convolutional Network Using Inter- and Intra-Body Graphs for Two-Person Interaction Recognition. IEEE Access 9: 110670-110682 (2021) - [j70]Kenichi Morita
An instruction set for reversible Turing machines. Acta Informatica 58(4): 377-396 (2021) - [j69]Kenichi Morita
Constructing Reversible Turing Machines in a Reversible and Conservative Elementary Triangular Cellular Automaton. J. Autom. Lang. Comb. 26(1-2): 125-144 (2021) - [c43]Kenichi Morita
How Can We Construct Reversible Turing Machines in a Very Simple Reversible Cellular Automaton? RC 2021: 3-21 - [i3]Genaro J. Martínez, Andrew Adamatzky, Shigeru Ninagawa, Kenichi Morita:
On Wave-Based Majority Gates with Cellular Automata. CoRR abs/2110.06013 (2021)
2010 – 2019
- 2019
- [j68]Kenichi Morita:
Reversible Marker Automata on Two-Dimensional Tapes. Int. J. Unconv. Comput. 14(5-6): 413-447 (2019) - [j67]Kenichi Morita
A universal non-conservative reversible elementary triangular partitioned cellular automaton that shows complex behavior. Nat. Comput. 18(3): 413-428 (2019) - 2018
- [j66]Kenichi Morita:
Language Recognition by Reversible Partitioned Cellular Automata and Iterative Arrays. J. Cell. Autom. 13(3): 183-213 (2018) - [j65]Genaro J. Martínez, Kenichi Morita:
Conservative Computing in a One-dimensional Cellular Automaton with Memory. J. Cell. Autom. 13(4): 325-346 (2018) - [p7]Kenichi Morita
A Snapshot of My Life. Reversibility and Universality 2018: 1-3 - [p6]Genaro J. Martínez, Andrew Adamatzky, Kenichi Morita
Logical Gates via Gliders Collisions. Reversibility and Universality 2018: 199-220 - [i2]Genaro J. Martínez, Andrew Adamatzky, Kenichi Morita:
Logical Gates via Gliders Collisions. CoRR abs/1803.05496 (2018) - 2017
- [b1]Kenichi Morita
Theory of Reversible Computing. Monographs in Theoretical Computer Science. An EATCS Series, Springer 2017, ISBN 978-4-431-56604-5, pp. 1-447 - [j64]Kenichi Morita:
Finding a Pathway from Reversible Microscopic Laws to Reversible Computers. Int. J. Unconv. Comput. 13(3): 203-213 (2017) - 2016
- [c42]Kenichi Morita
Universality of 8-State Reversible and Conservative Triangular Partitioned Cellular Automata. ACRI 2016: 45-54 - [c41]Kenichi Morita
An 8-State Simple Reversible Triangular Cellular Automaton that Exhibits Complex Behavior. Automata 2016: 170-184 - 2015
- [j63]Kenichi Morita
Universal Reversible Turing Machines with a Small Number of Tape Symbols. Fundam. Informaticae 138(1-2): 17-29 (2015) - [j62]Ming-Xiao Tang, Jia Lee, Kenichi Morita
General design of reversible sequential machines based on reversible logic elements. Theor. Comput. Sci. 568: 19-27 (2015) - 2014
- [j61]Kenichi Morita
Reversibility in space-bounded computation. Int. J. Gen. Syst. 43(7): 697-712 (2014) - [j60]Yuta Mukai, Tsuyoshi Ogiro, Kenichi Morita:
Universality Problems on Reversible Logic Elements with 1-Bit Memory. Int. J. Unconv. Comput. 10(5-6): 353-373 (2014) - [c40]Kenichi Morita
Language Recognition by Reversible Partitioned Cellular Automata. Automata 2014: 106-120 - [c39]Kenichi Morita
How Can We Construct Reversible Machines Out of Reversible Logic Element with Memory? Computing with New Resources 2014: 352-366 - [c38]Kenichi Morita:
Reversible Turing machines with a small number of states. NCMA 2014: 179-190 - [c37]Kenichi Morita
Compact Realization of Reversible Turing Machines by 2-State Reversible Logic Elements. UCNC 2014: 280-292 - 2013
- [j59]Chuzo Iwamoto
Generalized Chat Noir is PSPACE-Complete. IEICE Trans. Inf. Syst. 96-D(3): 502-505 (2013) - [j58]Ferdinand Peper, Jia Lee, Josep Carmona
Brownian Circuits: Fundamentals. ACM J. Emerg. Technol. Comput. Syst. 9(1): 3:1-3:24 (2013) - [c36]Kenichi Morita:
Reversible Logic Elements with Memory and Their Universality. MCU 2013: 3-14 - 2012
- [j57]Chuzo Iwamoto, Kento Sasaki, Kenichi Morita
A Polynomial-Time Reduction from the 3SAT Problem to the Generalized String Puzzle Problem. Algorithms 5(2): 261-272 (2012) - [j56]Chuzo Iwamoto
Generalized Shisen-Sho is NP-Complete. IEICE Trans. Inf. Syst. 95-D(11): 2712-2715 (2012) - [j55]Chuzo Iwamoto
Finding the Minimum Number of Face Guards is NP-Hard. IEICE Trans. Inf. Syst. 95-D(11): 2716-2719 (2012) - [j54]Kenichi Morita
Computation in reversible cellular automata. Int. J. Gen. Syst. 41(6): 569-581 (2012) - [j53]Yuta Mukai, Kenichi Morita:
Realizing Reversible Logic Elements with Memory in the Billiard Ball Model. Int. J. Unconv. Comput. 8(1): 47-59 (2012) - [j52]Chuzo Iwamoto, Junichi Kishi, Kenichi Morita:
Lower Bound of Face Guards of Polyhedral Terrains. Inf. Media Technol. 7(2): 737-739 (2012) - [j51]Chuzo Iwamoto, Junichi Kishi, Kenichi Morita
Lower Bound of Face Guards of Polyhedral Terrains. J. Inf. Process. 20(2): 435-437 (2012) - [j50]Kenichi Morita, Tsuyoshi Ogiro, Artiom Alhazov:
Non-degenerate 2-State Reversible Logic Elements with Three or More Symbols Are All Universal. J. Multiple Valued Log. Soft Comput. 18(1): 37-54 (2012) - [j49]Jon Timmis
Editorial for special issue on unconventional computation. Nat. Comput. 11(1): 65-66 (2012) - [j48]Artiom Alhazov
Sequential and maximally parallel multiset rewriting: reversibility and determinism. Nat. Comput. 11(1): 95-106 (2012) - [j47]Jia Lee, Rui-Long Yang, Kenichi Morita
Design of 1-tape 2-symbol reversible Turing machines based on reversible logic elements. Theor. Comput. Sci. 460: 78-88 (2012) - [c35]Chuzo Iwamoto, Kento Sasaki, Kenichi Morita:
Computational Complexity of String Puzzles. CATS 2012: 69-74 - [c34]Kenichi Morita
Reversible Computing Systems, Logic Circuits, and Cellular Automata. ICNC 2012: 1-8 - [c33]Kenichi Morita:
A Deterministic Two-Way Multi-head Finite Automaton Can Be Converted into a Reversible One with the Same Number of Heads. RC 2012: 29-43 - [c32]Kenichi Morita
Universality of One-Dimensional Reversible and Number-Conserving Cellular Automata. AUTOMATA & JAC 2012: 142-150 - [p5]Kenichi Morita
Reversible Cellular Automata. Handbook of Natural Computing 2012: 231-257 - 2011
- [j46]Kenichi Morita
Two-Way Reversible Multi-Head Finite Automata. Fundam. Informaticae 110(1-4): 241-254 (2011) - [j45]Kenichi Morita
Simulating reversible Turing machines and cyclic tag systems by one-dimensional reversible cellular automata. Theor. Comput. Sci. 412(30): 3856-3865 (2011) - [i1]Kenichi Morita, Robert Wille:
Design of Reversible and Quantum Circuits (Dagstuhl Seminar 11502). Dagstuhl Reports 1(12): 47-61 (2011) - 2010
- [j44]Chuzo Iwamoto
NP-Hard and k-EXPSPACE-Hard Cast Puzzles. IEICE Trans. Inf. Syst. 93-D(11): 2995-3004 (2010) - [c31]Genaro Juárez Martínez, Andrew Adamatzky, Kenichi Morita, Maurice Margenstern:
Computation with competing patterns in Life-like automaton. HPCS 2010: 564 - [c30]Artiom Alhazov
Reversibility and Determinism in Sequential Multiset Rewriting. UC 2010: 21-31 - [c29]Genaro Juárez Martínez, Kenichi Morita
Majority Adder Implementation by Competing Patterns in Life-Like Rule B2/S2345. UC 2010: 93-104 - [p4]Genaro J. Martínez, Andrew Adamatzky, Kenichi Morita
Computation with Competing Patterns in Life-Like Automaton. Game of Life Cellular Automata 2010: 547-572 - [e2]Cristian S. Calude, Masami Hagiya, Kenichi Morita, Grzegorz Rozenberg, Jon Timmis:
Unconventional Computation - 9th International Conference, UC 2010, Tokyo, Japan, June 21-25, 2010. Proceedings. Lecture Notes in Computer Science 6079, Springer 2010, ISBN 978-3-642-13522-4 [contents]
2000 – 2009
- 2009
- [j43]Naonori Tanimoto, Katsunobu Imai, Chuzo Iwamoto
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. 92-D(2): 255-257 (2009) - [c28]Chuzo Iwamoto, Kento Sasaki, Kenji Nishio, Kenichi Morita
Computational Complexity of Cast Puzzles. ISAAC 2009: 122-131 - [c27]Katsunobu Imai, Yasuaki Masamori, Chuzo Iwamoto, Kenichi Morita:
On Designing Gliders in Three-Dimensional Larger than Life Cellular Automata. IWNC 2009: 184-190 - [c26]Tsuyoshi Ogiro, Artiom Alhazov, Tsuyoshi Tanizawa, Kenichi Morita:
Universality of 2-State 3-Symbol Reversible Logic Elements - A Direct Simulation Method of a Rotary Element. IWNC 2009: 252-259 - [c25]Artiom Alhazov
On Reversibility and Determinism in P Systems. Workshop on Membrane Computing 2009: 158-168 - [c24]Kenichi Morita
Universality Issues in Reversible Computing Systems and Cellular Automata (Extended Abstract). RC@ETAPS 2009: 23-31 - [r2]Kenichi Morita:
Reversible Cellular Automata. Encyclopedia of Complexity and Systems Science 2009: 7679-7695 - [r1]Kenichi Morita:
Reversible Computing. Encyclopedia of Complexity and Systems Science 2009: 7695-7712 - 2008
- [j42]Chuzo Iwamoto
A Recursive Padding Technique on Nondeterministic Cellular Automata. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 91-A(9): 2335-2340 (2008) - [j41]Kenichi Morita:
Editorial. J. Cell. Autom. 3(2) (2008) - [j40]Kenichi Morita
Reversible computing and cellular automata - A survey. Theor. Comput. Sci. 395(1): 101-131 (2008) - [c23]Teijiro Isokawa, Ferdinand Peper, Masahiko Mitsui, Jian-Qin Liu, Kenichi Morita
Computing by Swarm Networks. ACRI 2008: 50-59 - [c22]Jia Lee, Ferdinand Peper, Susumu Adachi, Kenichi Morita
An Asynchronous Cellular Automaton Implementing 2-State 2-Input 2-Output Reversed-Twin Reversible Elements. ACRI 2008: 67-76 - [c21]Kenichi Morita:
A 24-state universal one-dimensional reversible cellular automaton. Automata 2008: 106-113 - [c20]Mitsuru Matsushima, Katsunobu Imai, Chuzo Iwamoto, Kenichi Morita:
A Java based three-dimensional cellular automata simulator and its application to three-dimensional Larger than Life. Automata 2008: 413-416 - [e1]Andrew Adamatzky, Ramón Alonso-Sanz, Anna T. Lawniczak, Genaro Juárez Martínez, Kenichi Morita, Thomas Worsch:
Automata 2008: Theory and Applications of Cellular Automata, Bristol, UK, June 12-14, 2008. Luniver Press, Frome, UK 2008, ISBN 978-1-905986-16-3 [contents] - 2007
- [j39]Chuzo Iwamoto
Translational lemmas for DLOGTIME-uniform circuits, alternating TMs, and PRAMs. Acta Informatica 44(5): 345-359 (2007) - [j38]Kenichi Morita:
Simple Universal One-Dimensional Reversible Cellular Automata. J. Cell. Autom. 2(2): 159-166 (2007) - [c19]Kenichi Morita, Jin-Shan Qi, Katsunobu Imai:
Pattern Generation and Parsing by Array Grammars. Formal Models, Languages and Applications 2007: 260-273 - [c18]Kenichi Morita, Yoshikazu Yamaguchi:
A Universal Reversible Turing Machine. MCU 2007: 90-98 - [c17]Chuzo Iwamoto, Harumasa Yoneda, Kenichi Morita, Katsunobu Imai:
A Time Hierarchy Theorem for Nondeterministic Cellular Automata. TAMC 2007: 511-520 - 2006
- [j37]Katsunobu Imai, Chuzo Iwamoto, Kenichi Morita:
A Five-State von Neumann Neighbor Universal Hyperbolic Cellular Automaton. J. Cell. Autom. 1(4): 275-297 (2006) - 2005
- [c16]Chuzo Iwamoto, Yoshiaki Nakashiba, Kenichi Morita, Katsunobu Imai:
Translational Lemmas for Alternating TMs and PRAMs. FCT 2005: 137-148 - 2004
- [j36]Kenichi Morita, Tsuyoshi Ogiro:
Simple Universal Reversible Cellular Automata in Which Reversible Logic Elements Can Be Embedded. IEICE Trans. Inf. Syst. 87-D(3): 650-656 (2004) - [j35]Katsunobu Imai, Akihiko Ikazaki, Chuzo Iwamoto, Kenichi Morita:
A Logically Universal Number-Conserving Cellular Automaton with a Unary Table-Lookup Function. IEICE Trans. Inf. Syst. 87-D(3): 694-699 (2004) - [j34]Chuzo Iwamoto, Tomoka Yokouchi, Kenichi Morita, Katsunobu Imai:
Prefix Computations on Iterative Arrays with Sequential Input/Output Mode. IEICE Trans. Inf. Syst. 87-D(3): 708-712 (2004) - [j33]Tsuyoshi Ogiro, Atsushi Kanno, Keiji Tanaka, Hiroko Kato, Kenichi Morita:
Nondegenerate 2-State 3-Symbol Reversible Logic Elements Are All Universal. Int. J. Unconv. Comput. 1(1): 47-67 (2004) - [j32]Jia Lee, Ferdinand Peper, Susumu Adachi, Kenichi Morita
Universal Delay-Insensitive Circuits with Bidirectional and Buffering Lines. IEEE Trans. Computers 53(8): 1034-1046 (2004) - [c15]Chuzo Iwamoto, Naoki Hatayama, Kenichi Morita, Katsunobu Imai, Daisuke Wakamatsu:
Hierarchies of DLOGTIME-Uniform Circuits. MCU 2004: 211-222 - [c14]Kenichi Morita, Tsuyoshi Ogiro, Keiji Tanaka, Hiroko Kato:
Classification and Universality of Reversible Logic Elements with One-Bit Memory. MCU 2004: 245-256 - 2003
- [j31]Chuzo Iwamoto, Katsuyuki Tateishi, Kenichi Morita, Katsunobu Imai:
Simulations Between Multi-dimensional Deterministic and Alternating Cellular Automata. Fundam. Informaticae 58(2003): 261-271 (2003) - [j30]Jia Lee, Susumu Adachi, Ferdinand Peper, Kenichi Morita:
Embedding Universal Delay-Insensitive Circuits in Asynchronous Cellular Spaces. Fundam. Informaticae 58(2003): 295-320 (2003) - [j29]Jia Lee, Katsunobu Imai, Kenichi Morita
Simulation of one-dimensional cellular automata by uniquely parallel parsable grammars. Theor. Comput. Sci. 304(1-3): 185-200 (2003) - [c13]Kenichi Morita:
A New Universal Logic Element for Reversible Computing. Grammars and Automata for String Processing 2003: 285-294 - 2002
- [j28]Chuzo Iwamoto, Katsuyuki Tateishi, Kenichi Morita
A quadratic speedup theorem for iterative arrays. Acta Informatica 38(11/12): 847-858 (2002) - [j27]Katsunobu Imai, Takahiro Hori, Kenichi Morita
Self-Reproduction in Three-Dimensional Reversible Cellular Space. Artif. Life 8(2): 155-174 (2002) - [j26]Katsunobu Imai, Kenichi Morita, Kenji Sako:
Firing Squad Synchronization Problem in Number-Conserving Cellular Automata. Fundam. Informaticae 52(1-3): 133-141 (2002) - [j25]Chuzo Iwamoto
Constructible functions in cellular automata and their applications to hierarchy results. Theor. Comput. Sci. 270(1-2): 797-809 (2002) - [c12]Chuzo Iwamoto, Takeshi Andou, Kenichi Morita, Katsunobu Imai:
Computational Complexity in the Hyperbolic Plane. MFCS 2002: 365-374 - [c11]Katsunobu Imai, Kenji Fujita, Chuzo Iwamoto, Kenichi Morita
Embedding a Logically Universal Model and a Self-Reproducing Model into Number-Conserving Cellular Automata. UMC 2002: 164-175 - [c10]Jia Lee, Ferdinand Peper, Susumu Adachi, Kenichi Morita
Reversible Computation in Asynchronous Cellular Automata. UMC 2002: 220-229 - [p3]Kenichi Morita, Yasuyuki Tojima, Katsunobu Imai, Tsuyoshi Ogiro:
Universal Computing in Reversible and Number-Conserving Two-Dimensional Cellular Spaces. Collision-Based Computing 2002: 161-199 - 2001
- [j24]Kenichi Morita
Number-Conserving Reversible Cellular Automata and Their Computation-Universality. RAIRO Theor. Informatics Appl. 35(3): 239-258 (2001) - [j23]Maurice Margenstern, Kenichi Morita
NP problems are tractable in the space of cellular automata in the hyperbolic plane. Theor. Comput. Sci. 259(1-2): 99-128 (2001) - [c9]Jia Lee, Kenichi Morita:
Generation and Parsing of Morphism Languages by Uniquely Parallel Parsable Grammars. Words, Semigroups, and Transductions 2001: 303-314 - [c8]Kenichi Morita:
A Simple Universal Logic Element and Cellular Automata for Reversible Computing. MCU 2001: 102-113 - [c7]Chuzo Iwamoto, Katsuyuki Tateishi, Kenichi Morita, Katsunobu Imai:
Speeding-Up Cellular Automata by Alternations. MCU 2001: 240-251 - [c6]Katsunobu Imai, Yukio Matsuda, Chuzo Iwamoto, Kenichi Morita
A three-dimensional uniquely parsable array grammar that generates and parses cubes. IWCIA 2001: 339-354 - 2000
- [j22]Jia Lee, Kenichi Morita, Hiroki Asou, Katsunobu Imai:
Uniquely Parsable Unification Grammars and Their Parser Implemented in Prolog. Grammars 3(1): 63-81 (2000) - [j21]Katsunobu Imai, Kenichi Morita
A computation-universal two-dimensional 8-state triangular reversible cellular automaton. Theor. Comput. Sci. 231(2): 181-191 (2000) - [c5]Kenichi Morita, Jia Lee:
Characterizing the Class of Deterministic Context-Free Languages by Semi-Right-Terminating Uniquely Parsable Grammars. Recent Topics in Mathematical and Computational Linguistics 2000: 207-217
1990 – 1999
- 1999
- [j20]Kenichi Morita
Characterizing the Ability of Parallel Array Generators on Reversible Partitioned Cellular Automata. Int. J. Pattern Recognit. Artif. Intell. 13(4): 523-538 (1999) - [j19]Kenichi Morita
Universality of Reversible Hexagonal Cellular Automata. RAIRO Theor. Informatics Appl. 33(6): 535-550 (1999) - [j18]Maurice Margenstern, Kenichi Morita:
A Polynomial Solution for 3-SAT in the Space of Cellular Automata in the Hyperbolic Plane. J. Univers. Comput. Sci. 5(9): 563-573 (1999) - [j17]Kenichi Morita
Uniquely parsable array grammars for generating and parsing connected patterns. Pattern Recognit. 32(2): 269-276 (1999) - [c4]Chuzo Iwamoto, Tomonobu Hatsuyama, Kenichi Morita, Katsunobu Imai:
On Time-Constructible Functions in One-Dimensional Cellular Automata. FCT 1999: 316-326 - 1998
- [c3]Katsunobu Imai, Kenichi Morita:
A computation-universal two-dimensional 8-state triangular reversible cellular automaton. MCU (2) 1998: 90-99 - 1997
- [j16]Kenichi Morita
A Hierarchy of Uniquely Parsable Grammar Classes and Deterministic Acceptors. Acta Informatica 34(5): 389-410 (1997) - 1996
- [j15]Katsunobu Imai, Kenichi Morita
Firing Squad Synchronization Problem in Reversible Cellular Automata. Theor. Comput. Sci. 165(2): 475-482 (1996) - [j14]Kenichi Morita
Universality of a Reversible Two-Counter Machine. Theor. Comput. Sci. 168(2): 303-320 (1996) - [j13]Kenichi Morita
Self-Reproduction in a Reversible Cellular Space. Theor. Comput. Sci. 168(2): 337-366 (1996) - [c2]Kenichi Morita
Logical Universality and Self-Reproduction in Reversible Cellular Automata. ICES 1996: 152-166 - 1995
- [j12]Kenichi Morita
Reversible Simulation of One-Dimensional Irreversible Cellular Automata. Theor. Comput. Sci. 148(1): 157-163 (1995) - 1994
- [j11]Kenichi Morita, Satoshi Ueno:
Parallel Generation and Parsing of Array Languages Using Reversible Cellular Automata. Int. J. Pattern Recognit. Artif. Intell. 8(2): 543-561 (1994) - 1992
- [j10]Yasunori Yamamoto, Kenichi Morita:
Two-Dimensional Uniquely Parsable Isometric Array Grammars. Int. J. Pattern Recognit. Artif. Intell. 6(2&3): 301-313 (1992) - [j9]Kenichi Morita
Computation-Universality of One-Dimensional One-Way Reversible Cellular Automata. Inf. Process. Lett. 42(6): 325-329 (1992) - [c1]Kenichi Morita, Satoshi Ueno:
Parallel Generation and Parsing of Array Languages Using Reversible Cellular Automata. ICPIA 1992: 213-230 - 1990
- [j8]Noritaka Nishihara, Kenichi Morita, Shigenori Iwata:
An extended syllogistic system with verbs and proper nouns, and its completeness proof. Syst. Comput. Jpn. 21(1): 96-111 (1990)
1980 – 1989
- 1989
- [j7]Yasunori Yamamoto, Kenichi Morita, Kazuhiro Sugata:
Context-sensitivity of Two-Dimensional Regular Array Grammars. Int. J. Pattern Recognit. Artif. Intell. 3(3-4): 295-320 (1989) - [j6]Kenichi Morita, Yasunori Yamamoto, Kazuhiro Sugata:
Two-Dimensional Three-Way Array Grammars and their Acceptors. Int. J. Pattern Recognit. Artif. Intell. 3(3-4): 353-376 (1989) - [j5]Noritaka Nishihara, Kenichi Morita
An extended syllogistic system with conjunctive and complementary terms, and its completeness proof. Syst. Comput. Jpn. 20(5): 80-95 (1989) - [p2]Yasunori Yamamoto, Kenichi Morita, Kazuhiro Sugata:
Context-sensitivity of Two-Dimensional Regular Array Grammars. Array Grammars, Patterns and Recognizers 1989: 17-42 - [p1]Kenichi Morita, Yasunori Yamamoto, Kazuhiro Sugata:
Two-Dimensional Three-Way Array Grammars and their Acceptors. Array Grammars, Patterns and Recognizers 1989: 75-98 - 1988
- [j4]Kenichi Morita
An efficient reasoning method for syllogism and its application to knowledge processing. Syst. Comput. Jpn. 19(3): 20-31 (1988) - 1986
- [j3]Kenichi Morita
On two-dimensional pattern-matching languages and their decision problems. Inf. Sci. 40(1): 53-66 (1986) - 1983
- [j2]Kenichi Morita
The complexity of some decision problems about two-dimensional array grammars. Inf. Sci. 30(3): 241-262 (1983) - 1982
- [j1]Hiroshi Umeo, Kenichi Morita
Deterministic One-Way Simulation of Two-Way Real-Time Cellular Automata and Its Related Problems. Inf. Process. Lett. 14(4): 158-161 (1982)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-01 20:47 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: