Kenichi Morita - researchr alias

researchr

You are not signed in
Sign in
Sign up

2012

Non-degenerate 2-State Reversible Logic Elements with Three or More Symbols Are All UniversalKenichi Morita, Tsuyoshi Ogiro, Artiom Alhazov. mvl, 18(1):37-54, 2012. [doi]

2011

Simulating reversible Turing machines and cyclic tag systems by one-dimensional reversible cellular automataKenichi Morita. TCS, 412(30):3856-3865, 2011. [doi]

2010

Reversibility and Determinism in Sequential Multiset RewritingArtiom Alhazov, Rudolf Freund, Kenichi Morita. uc 2010: 21-31 [doi]

Unconventional Computation - 9th International Conference, UC 2010, Tokyo, Japan, June 21-25, 2010. ProceedingsCristian S. Calude, Masami Hagiya, Kenichi Morita, Grzegorz Rozenberg, Jon Timmis, editors, Volume 6079 of Lecture Notes in Computer Science, Springer, 2010. [doi]

NP-Hard and ::::k::::-EXPSPACE-Hard Cast PuzzlesChuzo Iwamoto, Kento Sasaki, Kenji Nishio, Kenichi Morita. ieicet, 93-D(11):2995-3004, 2010. [doi]

Computation with competing patterns in Life-like automatonGenaro Juárez Martínez, Andrew Adamatzky, Kenichi Morita, Maurice Margenstern. ieeehpcs 2010: 564 [doi]

Majority Adder Implementation by Competing Patterns in Life-Like Rule ::::B::::2/::::S::::2345Genaro Juárez Martínez, Kenichi Morita, Andrew Adamatzky, Maurice Margenstern. uc 2010: 93-104 [doi]

Universality Issues in Reversible Computing Systems and Cellular Automata (Extended Abstract)Kenichi Morita. ENTCS, 253(6):23-31, 2010. [doi]

2009

On Reversibility and Determinism in P SystemsArtiom Alhazov, Kenichi Morita. membrane 2010: 158-168 [doi]

Computational Complexity of Cast PuzzlesChuzo Iwamoto, Kento Sasaki, Kenji Nishio, Kenichi Morita. isaac 2009: 122-131 [doi]

On the Non-existance of Rotation-Symmetric von Neumann Neighbor Number-Conserving Cellular Automata of Which the State Number is Less than FourNaonori Tanimoto, Katsunobu Imai, Chuzo Iwamoto, Kenichi Morita. ieicet, 92-D(2):255-257, 2009. [doi]

2008

2007

2006

A Five-State von Neumann Neighbor Universal Hyperbolic Cellular AutomatonKatsunobu Imai, Chuzo Iwamoto, Kenichi Morita. jca, 1(4):275-297, 2006. [doi]

2005

Translational Lemmas for Alternating TMs and PRAMsChuzo Iwamoto, Yoshiaki Nakashiba, Kenichi Morita, Katsunobu Imai. fct 2005: 137-148 [doi]

2004

A Logically Universal Number-Conserving Cellular Automaton with a Unary Table-Lookup FunctionKatsunobu Imai, Akihiko Ikazaki, Chuzo Iwamoto, Kenichi Morita. ieicet, 87-D(3):694-699, 2004. [doi]

Hierarchies of DLOGTIME-Uniform CircuitsChuzo Iwamoto, Naoki Hatayama, Kenichi Morita, Katsunobu Imai, Daisuke Wakamatsu. mcu 2005: 211-222 [doi]

Prefix Computations on Iterative Arrays with Sequential Input/Output ModeChuzo Iwamoto, Tomoka Yokouchi, Kenichi Morita, Katsunobu Imai. ieicet, 87-D(3):708-712, 2004. [doi]

Universal Delay-Insensitive Circuits with Bidirectional and Buffering LinesJia Lee, Ferdinand Peper, Susumu Adachi, Kenichi Morita. TC, 53(8):1034-1046, 2004. [doi]

Simple Universal Reversible Cellular Automata in Which Reversible Logic Elements Can Be EmbeddedKenichi Morita, Tsuyoshi Ogiro. ieicet, 87-D(3):650-656, 2004. [doi]

Classification and Universality of Reversible Logic Elements with One-Bit MemoryKenichi Morita, Tsuyoshi Ogiro, Keiji Tanaka, Hiroko Kato. mcu 2005: 245-256 [doi]

2003

2002

Embedding a Logically Universal Model and a Self-Reproducing Model into Number-Conserving Cellular AutomataKatsunobu Imai, Kenji Fujita, Chuzo Iwamoto, Kenichi Morita. umc 2002: 164-175 [doi]

Self-Reproduction in Three-Dimensional Reversible Cellular SpaceKatsunobu Imai, Takahiro Hori, Kenichi Morita. alife, 8(2):155-174, 2002.

Firing Squad Synchronization Problem in Number-Conserving Cellular AutomataKatsunobu Imai, Kenichi Morita, Kenji Sako. FUIN, 52(1-3):133-141, 2002. [doi]

Computational Complexity in the Hyperbolic PlaneChuzo Iwamoto, Takeshi Andou, Kenichi Morita, Katsunobu Imai. mfcs 2002: 365-374 [doi]

Constructible functions in cellular automata and their applications to hierarchy resultsChuzo Iwamoto, Tomonobu Hatsuyama, Kenichi Morita, Katsunobu Imai. TCS, 270(1-2):797-809, 2002. [doi]

A quadratic speedup theorem for iterative arraysChuzo Iwamoto, Katsuyuki Tateishi, Kenichi Morita, Katsunobu Imai. ACTA, 38(11/12):847-858, 2002. [doi]

Reversible Computation in Asynchronous Cellular AutomataJia Lee, Ferdinand Peper, Susumu Adachi, Kenichi Morita, Shinro Mashiko. umc 2002: 220-229 [doi]

2001

A three-dimensional uniquely parsable array grammar that generates and parses cubesKatsunobu Imai, Yukio Matsuda, Chuzo Iwamoto, Kenichi Morita. ENTCS, 46, 2001. [doi]

Speeding-Up Cellular Automata by AlternationsChuzo Iwamoto, Katsuyuki Tateishi, Kenichi Morita, Katsunobu Imai. mcu 2001: 240-251 [doi]

Generation and Parsing of Morphism Languages by Uniquely Parallel Parsable GrammarsJia Lee, Kenichi Morita. BIRTHDAY 2001: 303-314

NP problems are tractable in the space of cellular automata in the hyperbolic planeMaurice Margenstern, Kenichi Morita. TCS, 259(1-2):99-128, 2001. [doi]

Number-Conserving Reversible Cellular Automata and Their Computation-UniversalityKenichi Morita, Katsunobu Imai. ita, 35(3):239-258, 2001. [doi]

A Simple Universal Logic Element and Cellular Automata for Reversible ComputingKenichi Morita. mcu 2001: 102-113 [doi]

2000

Uniquely Parsable Unification Grammars and Their Parser Implemented in PrologJia Lee, Kenichi Morita, Hiroki Asou, Katsunobu Imai. grammars, 3(1):63-81, 2000.

Characterizing the Class of Deterministic Context-Free Languages by Semi-Right-Terminating Uniquely Parsable GrammarsKenichi Morita, Jia Lee. BIRTHDAY 2000: 207-217

1999

1998

A computation-universal two-dimensional 8-state triangular reversible cellular automatonKatsunobu Imai, Kenichi Morita. mcu 1998: 90-99

1997

A Hierarchy of Uniquely Parsable Grammar Classes and Deterministic AcceptorsKenichi Morita, Noritaka Nishihara, Yasunori Yamamoto, Zhiguo Zhang. ACTA, 34(5):389-410, 1997.

1996

Firing Squad Synchronization Problem in Reversible Cellular AutomataKatsunobu Imai, Kenichi Morita. TCS, 165(2):475-482, 1996. [doi]

Universality of a Reversible Two-Counter MachineKenichi Morita. TCS, 168(2):303-320, 1996. [doi]

Logical Universality and Self-Reproduction in Reversible Cellular AutomataKenichi Morita, Katsunobu Imai. ices 1996: 152-166

Self-Reproduction in a Reversible Cellular SpaceKenichi Morita, Katsunobu Imai. TCS, 168(2):337-366, 1996. [doi]

1995

Reversible Simulation of One-Dimensional Irreversible Cellular AutomataKenichi Morita. TCS, 148(1):157-163, 1995. [doi]

1994

Parallel Generation and Parsing of Array Languages Using Reversible Cellular AutomataKenichi Morita, Satoshi Ueno. ijprai, 8(2):543-561, 1994.

1992

Computation-Universality of One-Dimensional One-Way Reversible Cellular AutomataKenichi Morita. ipl, 42(6):325-329, 1992.

Parallel Generation and Parsing of Array Languages Using Reversible Cellular AutomataKenichi Morita, Satoshi Ueno. icpia 1992: 213-230

Two-Dimensional Uniquely Parsable Isometric Array GrammarsYasunori Yamamoto, Kenichi Morita. ijprai, 6(2&3):301-313, 1992.

1986

On two-dimensional pattern-matching languages and their decision problemsKenichi Morita, Kaoru Nakazono, Kazuhiro Sugata. isci, 40(1):53-66, 1986. [doi]

1983

The complexity of some decision problems about two-dimensional array grammarsKenichi Morita, Yasunori Yamamoto, Kazuhiro Sugata. isci, 30(3):241-262, 1983. [doi]

1982

Deterministic One-Way Simulation of Two-Way Real-Time Cellular Automata and Its Related ProblemsHiroshi Umeo, Kenichi Morita, Kazuhiro Sugata. ipl, 14(4):158-161, 1982.