![]() | ![]() |
| 2012 | ||
|---|---|---|
| 78 | 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) | |
| 77 | Yuuta Mukai, Kenichi Morita: Realizing Reversible Logic Elements with Memory in the Billiard Ball Model. IJUC 8(1): 47-59 (2012) | |
| 76 | Kenichi Morita, Tsuyoshi Ogiro, Artiom Alhazov: Non-degenerate 2-State Reversible Logic Elements with Three or More Symbols Are All Universal. Multiple-Valued Logic and Soft Computing 18(1): 37-54 (2012) | |
| 75 | Jon Timmis, Kenichi Morita: Editorial for special issue on unconventional computation. Natural Computing 11(1): 65-66 (2012) | |
| 74 | Artiom Alhazov, Rudolf Freund, Kenichi Morita: Sequential and maximally parallel multiset rewriting: reversibility and determinism. Natural Computing 11(1): 95-106 (2012) | |
| 2011 | ||
| 73 | Kenichi Morita, Robert Wille: Design of Reversible and Quantum Circuits (Dagstuhl Seminar 11502). Dagstuhl Reports 1(12): 47-61 (2011) | |
| 72 | Kenichi Morita: Two-Way Reversible Multi-Head Finite Automata. Fundam. Inform. 110(1-4): 241-254 (2011) | |
| 71 | Kenichi Morita: Simulating reversible Turing machines and cyclic tag systems by one-dimensional reversible cellular automata. Theor. Comput. Sci. 412(30): 3856-3865 (2011) | |
| 2010 | ||
| 70 | 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 Springer 2010 | |
| 69 | Genaro Juárez Martínez, Andrew Adamatzky, Kenichi Morita, Maurice Margenstern: Computation with competing patterns in Life-like automaton. HPCS 2010: 564 | |
| 68 | Artiom Alhazov, Rudolf Freund, Kenichi Morita: Reversibility and Determinism in Sequential Multiset Rewriting. UC 2010: 21-31 | |
| 67 | Genaro Juárez Martínez, Kenichi Morita, Andrew Adamatzky, Maurice Margenstern: Majority Adder Implementation by Competing Patterns in Life-Like Rule B2/S2345. UC 2010: 93-104 | |
| 66 | Kenichi Morita: Universality Issues in Reversible Computing Systems and Cellular Automata (Extended Abstract). Electr. Notes Theor. Comput. Sci. 253(6): 23-31 (2010) | |
| 65 | Chuzo Iwamoto, Kento Sasaki, Kenji Nishio, Kenichi Morita: NP-Hard and k-EXPSPACE-Hard Cast Puzzles. IEICE Transactions 93-D(11): 2995-3004 (2010) | |
| 2009 | ||
| 64 | Chuzo Iwamoto, Kento Sasaki, Kenji Nishio, Kenichi Morita: Computational Complexity of Cast Puzzles. ISAAC 2009: 122-131 | |
| 63 | Artiom Alhazov, Kenichi Morita: On Reversibility and Determinism in P Systems. Workshop on Membrane Computing 2009: 158-168 | |
| 62 | Kenichi Morita: Reversible Cellular Automata. Encyclopedia of Complexity and Systems Science 2009: 7679-7695 | |
| 61 | Kenichi Morita: Reversible Computing. Encyclopedia of Complexity and Systems Science 2009: 7695-7712 | |
| 60 | Naonori Tanimoto, Katsunobu Imai, Chuzo Iwamoto, Kenichi Morita: 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 92-D(2): 255-257 (2009) | |
| 2008 | ||
| 59 | 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 | |
| 58 | Teijiro Isokawa, Ferdinand Peper, Masahiko Mitsui, Jian-Qin Liu, Kenichi Morita, Hiroshi Umeo, Naotake Kamiura, Nobuyuki Matsui: Computing by Swarm Networks. ACRI 2008: 50-59 | |
| 57 | 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 | |
| 56 | Kenichi Morita: A 24-state universal one-dimensional reversible cellular automaton. Automata 2008: 106-113 | |
| 55 | 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 | |
| 54 | Chuzo Iwamoto, Harumasa Yoneda, Kenichi Morita, Katsunobu Imai: A Recursive Padding Technique on Nondeterministic Cellular Automata. IEICE Transactions 91-A(9): 2335-2340 (2008) | |
| 53 | Kenichi Morita: Editorial. J. Cellular Automata 3(2): (2008) | |
| 52 | Kenichi Morita: Reversible computing and cellular automata - A survey. Theor. Comput. Sci. 395(1): 101-131 (2008) | |
| 2007 | ||
| 51 | Kenichi Morita, Yoshikazu Yamaguchi: A Universal Reversible Turing Machine. MCU 2007: 90-98 | |
| 50 | Chuzo Iwamoto, Harumasa Yoneda, Kenichi Morita, Katsunobu Imai: A Time Hierarchy Theorem for Nondeterministic Cellular Automata. TAMC 2007: 511-520 | |
| 49 | Chuzo Iwamoto, Naoki Hatayama, Yoshiaki Nakashiba, Kenichi Morita, Katsunobu Imai: Translational lemmas for DLOGTIME-uniform circuits, alternating TMs, and PRAMs. Acta Inf. 44(5): 345-359 (2007) | |
| 48 | Kenichi Morita: Simple Universal One-Dimensional Reversible Cellular Automata. J. Cellular Automata 2(2): 159-166 (2007) | |
| 2006 | ||
| 47 | Katsunobu Imai, Chuzo Iwamoto, Kenichi Morita: A Five-State von Neumann Neighbor Universal Hyperbolic Cellular Automaton. J. Cellular Automata 1(4): 275-297 (2006) | |
| 2005 | ||
| 46 | Chuzo Iwamoto, Yoshiaki Nakashiba, Kenichi Morita, Katsunobu Imai: Translational Lemmas for Alternating TMs and PRAMs. FCT 2005: 137-148 | |
| 2004 | ||
| 45 | Chuzo Iwamoto, Naoki Hatayama, Kenichi Morita, Katsunobu Imai, Daisuke Wakamatsu: Hierarchies of DLOGTIME-Uniform Circuits. MCU 2004: 211-222 | |
| 44 | Kenichi Morita, Tsuyoshi Ogiro, Keiji Tanaka, Hiroko Kato: Classification and Universality of Reversible Logic Elements with One-Bit Memory. MCU 2004: 245-256 | |
| 43 | 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) | |
| 42 | Kenichi Morita, Tsuyoshi Ogiro: Simple Universal Reversible Cellular Automata in Which Reversible Logic Elements Can Be Embedded. IEICE Transactions 87-D(3): 650-656 (2004) | |
| 41 | Katsunobu Imai, Akihiko Ikazaki, Chuzo Iwamoto, Kenichi Morita: A Logically Universal Number-Conserving Cellular Automaton with a Unary Table-Lookup Function. IEICE Transactions 87-D(3): 694-699 (2004) | |
| 40 | Chuzo Iwamoto, Tomoka Yokouchi, Kenichi Morita, Katsunobu Imai: Prefix Computations on Iterative Arrays with Sequential Input/Output Mode. IEICE Transactions 87-D(3): 708-712 (2004) | |
| 2003 | ||
| 39 | Kenichi Morita: A New Universal Logic Element for Reversible Computing. Grammars and Automata for String Processing 2003: 285-294 | |
| 38 | Chuzo Iwamoto, Katsuyuki Tateishi, Kenichi Morita, Katsunobu Imai: Simulations Between Multi-dimensional Deterministic and Alternating Cellular Automata. Fundam. Inform. 58(2003): 261-271 (2003) | |
| 37 | Jia Lee, Susumu Adachi, Ferdinand Peper, Kenichi Morita: Embedding Universal Delay-Insensitive Circuits in Asynchronous Cellular Spaces. Fundam. Inform. 58(2003): 295-320 (2003) | |
| 36 | Jia Lee, Katsunobu Imai, Kenichi Morita: Simulation of one-dimensional cellular automata by uniquely parallel parsable grammars. Theor. Comput. Sci. 1-3(304): 185-200 (2003) | |
| 2002 | ||
| 35 | Chuzo Iwamoto, Takeshi Andou, Kenichi Morita, Katsunobu Imai: Computational Complexity in the Hyperbolic Plane. MFCS 2002: 365-374 | |
| 34 | 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 | |
| 33 | Jia Lee, Ferdinand Peper, Susumu Adachi, Kenichi Morita, Shinro Mashiko: Reversible Computation in Asynchronous Cellular Automata. UMC 2002: 220-229 | |
| 32 | Chuzo Iwamoto, Katsuyuki Tateishi, Kenichi Morita, Katsunobu Imai: A quadratic speedup theorem for iterative arrays. Acta Inf. 38(11/12): 847-858 (2002) | |
| 31 | Katsunobu Imai, Takahiro Hori, Kenichi Morita: Self-Reproduction in Three-Dimensional Reversible Cellular Space. Artificial Life 8(2): 155-174 (2002) | |
| 30 | Katsunobu Imai, Kenichi Morita, Kenji Sako: Firing Squad Synchronization Problem in Number-Conserving Cellular Automata. Fundam. Inform. 52(1-3): 133-141 (2002) | |
| 29 | Chuzo Iwamoto, Tomonobu Hatsuyama, Kenichi Morita, Katsunobu Imai: Constructible functions in cellular automata and their applications to hierarchy results. Theor. Comput. Sci. 270(1-2): 797-809 (2002) | |
| 2001 | ||
| 28 | Kenichi Morita: A Simple Universal Logic Element and Cellular Automata for Reversible Computing. MCU 2001: 102-113 | |
| 27 | Chuzo Iwamoto, Katsuyuki Tateishi, Kenichi Morita, Katsunobu Imai: Speeding-Up Cellular Automata by Alternations. MCU 2001: 240-251 | |
| 26 | Jia Lee, Kenichi Morita: Generation and Parsing of Morphism Languages by Uniquely Parallel Parsable Grammars. Words, Semigroups, and Transductions 2001: 303-314 | |
| 25 | Katsunobu Imai, Yukio Matsuda, Chuzo Iwamoto, Kenichi Morita: A three-dimensional uniquely parsable array grammar that generates and parses cubes. Electr. Notes Theor. Comput. Sci. 46: 339-354 (2001) | |
| 24 | Kenichi Morita, Katsunobu Imai: Number-Conserving Reversible Cellular Automata and Their Computation-Universality. ITA 35(3): 239-258 (2001) | |
| 23 | 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) | |
| 2000 | ||
| 22 | 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 | |
| 21 | Jia Lee, Kenichi Morita, Hiroki Asou, Katsunobu Imai: Uniquely Parsable Unification Grammars and Their Parser Implemented in Prolog. Grammars 3(1): 63-81 (2000) | |
| 20 | Katsunobu Imai, Kenichi Morita: A computation-universal two-dimensional 8-state triangular reversible cellular automaton. Theor. Comput. Sci. 231(2): 181-191 (2000) | |
| 1999 | ||
| 19 | Chuzo Iwamoto, Tomonobu Hatsuyama, Kenichi Morita, Katsunobu Imai: On Time-Constructible Functions in One-Dimensional Cellular Automata. FCT 1999: 316-326 | |
| 18 | Kenichi Morita, Satoshi Ueno, Katsunobu Imai: Characterizing the Ability of Parallel Array Generators on Reversible Partitioned Cellular Automata. IJPRAI 13(4): 523-538 (1999) | |
| 17 | Kenichi Morita, Maurice Margenstern, Katsunobu Imai: Universality of Reversible Hexagonal Cellular Automata. ITA 33(6): 535-550 (1999) | |
| 16 | Maurice Margenstern, Kenichi Morita: A Polynomial Solution for 3-SAT in the Space of Cellular Automata in the Hyperbolic Plane. J. UCS 5(9): 563-573 (1999) | |
| 15 | Kenichi Morita, Katsunobu Imai: Uniquely parsable array grammars for generating and parsing connected patterns. Pattern Recognition 32(2): 269-276 (1999) | |
| 1998 | ||
| 14 | Katsunobu Imai, Kenichi Morita: A computation-universal two-dimensional 8-state triangular reversible cellular automaton. MCU (2) 1998: 90-99 | |
| 1997 | ||
| 13 | Kenichi Morita, Noritaka Nishihara, Yasunori Yamamoto, Zhiguo Zhang: A Hierarchy of Uniquely Parsable Grammar Classes and Deterministic Acceptors. Acta Inf. 34(5): 389-410 (1997) | |
| 1996 | ||
| 12 | Kenichi Morita, Katsunobu Imai: Logical Universality and Self-Reproduction in Reversible Cellular Automata. ICES 1996: 152-166 | |
| 11 | Katsunobu Imai, Kenichi Morita: Firing Squad Synchronization Problem in Reversible Cellular Automata. Theor. Comput. Sci. 165(2): 475-482 (1996) | |
| 10 | Kenichi Morita: Universality of a Reversible Two-Counter Machine. Theor. Comput. Sci. 168(2): 303-320 (1996) | |
| 9 | Kenichi Morita, Katsunobu Imai: Self-Reproduction in a Reversible Cellular Space. Theor. Comput. Sci. 168(2): 337-366 (1996) | |
| 1995 | ||
| 8 | Kenichi Morita: Reversible Simulation of One-Dimensional Irreversible Cellular Automata. Theor. Comput. Sci. 148(1): 157-163 (1995) | |
| 1994 | ||
| 7 | Kenichi Morita, Satoshi Ueno: Parallel Generation and Parsing of Array Languages Using Reversible Cellular Automata. IJPRAI 8(2): 543-561 (1994) | |
| 1992 | ||
| 6 | Kenichi Morita, Satoshi Ueno: Parallel Generation and Parsing of Array Languages Using Reversible Cellular Automata. ICPIA 1992: 213-230 | |
| 5 | Yasunori Yamamoto, Kenichi Morita: Two-Dimensional Uniquely Parsable Isometric Array Grammars. IJPRAI 6(2&3): 301-313 (1992) | |
| 4 | Kenichi Morita: Computation-Universality of One-Dimensional One-Way Reversible Cellular Automata. Inf. Process. Lett. 42(6): 325-329 (1992) | |
| 1986 | ||
| 3 | Kenichi Morita, Kaoru Nakazono, Kazuhiro Sugata: On two-dimensional pattern-matching languages and their decision problems. Inf. Sci. 40(1): 53-66 (1986) | |
| 1983 | ||
| 2 | Kenichi Morita, Yasunori Yamamoto, Kazuhiro Sugata: The complexity of some decision problems about two-dimensional array grammars. Inf. Sci. 30(3): 241-262 (1983) | |
| 1982 | ||
| 1 | Hiroshi Umeo, Kenichi Morita, Kazuhiro Sugata: Deterministic One-Way Simulation of Two-Way Real-Time Cellular Automata and Its Related Problems. Inf. Process. Lett. 14(4): 158-161 (1982) | |
Colors in the list of coauthors
Last update Sun Jun 3 16:06:10 2012 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page