The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Kenichi Morita: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Jia Lee, Kenichi Morita
    Generation and Parsing of Morphism Languages by Uniquely Parallel Parsable Grammars. [Citation Graph (0, 0)][DBLP]
    Words, Semigroups, and Transductions, 2001, pp:303-314 [Conf]
  2. Kenichi Morita
    A New Universal Logic Element for Reversible Computing. [Citation Graph (0, 0)][DBLP]
    Grammars and Automata for String Processing, 2003, pp:285-294 [Conf]
  3. Kenichi Morita, Jia Lee
    Characterizing the Class of Deterministic Context-Free Languages by Semi-Right-Terminating Uniquely Parsable Grammars. [Citation Graph (0, 0)][DBLP]
    Recent Topics in Mathematical and Computational Linguistics, 2000, pp:207-217 [Conf]
  4. Chuzo Iwamoto, Tomonobu Hatsuyama, Kenichi Morita, Katsunobu Imai
    On Time-Constructible Functions in One-Dimensional Cellular Automata. [Citation Graph (0, 0)][DBLP]
    FCT, 1999, pp:316-326 [Conf]
  5. Chuzo Iwamoto, Yoshiaki Nakashiba, Kenichi Morita, Katsunobu Imai
    Translational Lemmas for Alternating TMs and PRAMs. [Citation Graph (0, 0)][DBLP]
    FCT, 2005, pp:137-148 [Conf]
  6. Kenichi Morita, Katsunobu Imai
    Logical Universality and Self-Reproduction in Reversible Cellular Automata. [Citation Graph (0, 0)][DBLP]
    ICES, 1996, pp:152-166 [Conf]
  7. Kenichi Morita, Satoshi Ueno
    Parallel Generation and Parsing of Array Languages Using Reversible Cellular Automata. [Citation Graph (0, 0)][DBLP]
    ICPIA, 1992, pp:213-230 [Conf]
  8. Katsunobu Imai, Kenichi Morita
    A computation-universal two-dimensional 8-state triangular reversible cellular automaton. [Citation Graph (0, 0)][DBLP]
    MCU (2), 1998, pp:90-99 [Conf]
  9. Chuzo Iwamoto, Naoki Hatayama, Kenichi Morita, Katsunobu Imai, Daisuke Wakamatsu
    Hierarchies of DLOGTIME-Uniform Circuits. [Citation Graph (0, 0)][DBLP]
    MCU, 2004, pp:211-222 [Conf]
  10. Chuzo Iwamoto, Katsuyuki Tateishi, Kenichi Morita, Katsunobu Imai
    Speeding-Up Cellular Automata by Alternations. [Citation Graph (0, 0)][DBLP]
    MCU, 2001, pp:240-251 [Conf]
  11. Kenichi Morita
    A Simple Universal Logic Element and Cellular Automata for Reversible Computing. [Citation Graph (0, 0)][DBLP]
    MCU, 2001, pp:102-113 [Conf]
  12. Kenichi Morita, Tsuyoshi Ogiro, Keiji Tanaka, Hiroko Kato
    Classification and Universality of Reversible Logic Elements with One-Bit Memory. [Citation Graph (0, 0)][DBLP]
    MCU, 2004, pp:245-256 [Conf]
  13. Chuzo Iwamoto, Takeshi Andou, Kenichi Morita, Katsunobu Imai
    Computational Complexity in the Hyperbolic Plane. [Citation Graph (0, 0)][DBLP]
    MFCS, 2002, pp:365-374 [Conf]
  14. Katsunobu Imai, Kenji Fujita, Chuzo Iwamoto, Kenichi Morita
    Embedding a Logically Universal Model and a Self-Reproducing Model into Number-Conserving Cellular Automata. [Citation Graph (0, 0)][DBLP]
    UMC, 2002, pp:164-175 [Conf]
  15. Jia Lee, Ferdinand Peper, Susumu Adachi, Kenichi Morita, Shinro Mashiko
    Reversible Computation in Asynchronous Cellular Automata. [Citation Graph (0, 0)][DBLP]
    UMC, 2002, pp:220-229 [Conf]
  16. Chuzo Iwamoto, Katsuyuki Tateishi, Kenichi Morita, Katsunobu Imai
    A quadratic speedup theorem for iterative arrays. [Citation Graph (0, 0)][DBLP]
    Acta Inf., 2002, v:38, n:11/12, pp:847-858 [Journal]
  17. Kenichi Morita, Noritaka Nishihara, Yasunori Yamamoto, Zhiguo Zhang
    A Hierarchy of Uniquely Parsable Grammar Classes and Deterministic Acceptors. [Citation Graph (0, 0)][DBLP]
    Acta Inf., 1997, v:34, n:5, pp:389-410 [Journal]
  18. Katsunobu Imai, Takahiro Hori, Kenichi Morita
    Self-Reproduction in Three-Dimensional Reversible Cellular Space. [Citation Graph (0, 0)][DBLP]
    Artificial Life, 2002, v:8, n:2, pp:155-174 [Journal]
  19. Katsunobu Imai, Yukio Matsuda, Chuzo Iwamoto, Kenichi Morita
    A three-dimensional uniquely parsable array grammar that generates and parses cubes. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 2001, v:46, n:, pp:- [Journal]
  20. Katsunobu Imai, Kenichi Morita, Kenji Sako
    Firing Squad Synchronization Problem in Number-Conserving Cellular Automata. [Citation Graph (0, 0)][DBLP]
    Fundam. Inform., 2002, v:52, n:1-3, pp:133-141 [Journal]
  21. Chuzo Iwamoto, Katsuyuki Tateishi, Kenichi Morita, Katsunobu Imai
    Simulations Between Multi-dimensional Deterministic and Alternating Cellular Automata. [Citation Graph (0, 0)][DBLP]
    Fundam. Inform., 2003, v:58, n:2003, pp:261-271 [Journal]
  22. Jia Lee, Susumu Adachi, Ferdinand Peper, Kenichi Morita
    Embedding Universal Delay-Insensitive Circuits in Asynchronous Cellular Spaces. [Citation Graph (0, 0)][DBLP]
    Fundam. Inform., 2003, v:58, n:2003, pp:295-320 [Journal]
  23. Jia Lee, Kenichi Morita, Hiroki Asou, Katsunobu Imai
    Uniquely Parsable Unification Grammars and Their Parser Implemented in Prolog. [Citation Graph (0, 0)][DBLP]
    Grammars, 2000, v:3, n:1, pp:63-81 [Journal]
  24. Kenichi Morita, Satoshi Ueno
    Parallel Generation and Parsing of Array Languages Using Reversible Cellular Automata. [Citation Graph (0, 0)][DBLP]
    IJPRAI, 1994, v:8, n:2, pp:543-561 [Journal]
  25. Kenichi Morita, Satoshi Ueno, Katsunobu Imai
    Characterizing the Ability of Parallel Array Generators on Reversible Partitioned Cellular Automata. [Citation Graph (0, 0)][DBLP]
    IJPRAI, 1999, v:13, n:4, pp:523-538 [Journal]
  26. Yasunori Yamamoto, Kenichi Morita
    Two-Dimensional Uniquely Parsable Isometric Array Grammars. [Citation Graph (0, 0)][DBLP]
    IJPRAI, 1992, v:6, n:2&3, pp:301-313 [Journal]
  27. Kenichi Morita
    Computation-Universality of One-Dimensional One-Way Reversible Cellular Automata. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1992, v:42, n:6, pp:325-329 [Journal]
  28. Hiroshi Umeo, Kenichi Morita, Kazuhiro Sugata
    Deterministic One-Way Simulation of Two-Way Real-Time Cellular Automata and Its Related Problems. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1982, v:14, n:4, pp:158-161 [Journal]
  29. Kenichi Morita, Kaoru Nakazono, Kazuhiro Sugata
    On two-dimensional pattern-matching languages and their decision problems. [Citation Graph (0, 0)][DBLP]
    Inf. Sci., 1986, v:40, n:1, pp:53-66 [Journal]
  30. Kenichi Morita, Yasunori Yamamoto, Kazuhiro Sugata
    The complexity of some decision problems about two-dimensional array grammars. [Citation Graph (0, 0)][DBLP]
    Inf. Sci., 1983, v:30, n:3, pp:241-262 [Journal]
  31. Kenichi Morita, Katsunobu Imai
    Number-Conserving Reversible Cellular Automata and Their Computation-Universality. [Citation Graph (0, 0)][DBLP]
    ITA, 2001, v:35, n:3, pp:239-258 [Journal]
  32. Kenichi Morita, Maurice Margenstern, Katsunobu Imai
    Universality of Reversible Hexagonal Cellular Automata. [Citation Graph (0, 0)][DBLP]
    ITA, 1999, v:33, n:6, pp:535-550 [Journal]
  33. Maurice Margenstern, Kenichi Morita
    A Polynomial Solution for 3-SAT in the Space of Cellular Automata in the Hyperbolic Plane. [Citation Graph (0, 0)][DBLP]
    J. UCS, 1999, v:5, n:9, pp:563-573 [Journal]
  34. Kenichi Morita, Katsunobu Imai
    Uniquely parsable array grammars for generating and parsing connected patterns. [Citation Graph (0, 0)][DBLP]
    Pattern Recognition, 1999, v:32, n:2, pp:269-276 [Journal]
  35. Jia Lee, Ferdinand Peper, Susumu Adachi, Kenichi Morita
    Universal Delay-Insensitive Circuits with Bidirectional and Buffering Lines. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Computers, 2004, v:53, n:8, pp:1034-1046 [Journal]
  36. Katsunobu Imai, Kenichi Morita
    A computation-universal two-dimensional 8-state triangular reversible cellular automaton. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2000, v:231, n:2, pp:181-191 [Journal]
  37. Katsunobu Imai, Kenichi Morita
    Firing Squad Synchronization Problem in Reversible Cellular Automata. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1996, v:165, n:2, pp:475-482 [Journal]
  38. Chuzo Iwamoto, Tomonobu Hatsuyama, Kenichi Morita, Katsunobu Imai
    Constructible functions in cellular automata and their applications to hierarchy results. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2002, v:270, n:1-2, pp:797-809 [Journal]
  39. Jia Lee, Katsunobu Imai, Kenichi Morita
    Simulation of one-dimensional cellular automata by uniquely parallel parsable grammars. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:1, n:304, pp:185-200 [Journal]
  40. Maurice Margenstern, Kenichi Morita
    NP problems are tractable in the space of cellular automata in the hyperbolic plane. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2001, v:259, n:1-2, pp:99-128 [Journal]
  41. Kenichi Morita
    Reversible Simulation of One-Dimensional Irreversible Cellular Automata. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1995, v:148, n:1, pp:157-163 [Journal]
  42. Kenichi Morita
    Universality of a Reversible Two-Counter Machine. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1996, v:168, n:2, pp:303-320 [Journal]
  43. Kenichi Morita, Katsunobu Imai
    Self-Reproduction in a Reversible Cellular Space. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1996, v:168, n:2, pp:337-366 [Journal]
  44. Kenichi Morita, Yoshikazu Yamaguchi
    A Universal Reversible Turing Machine. [Citation Graph (0, 0)][DBLP]
    MCU, 2007, pp:90-98 [Conf]
  45. Chuzo Iwamoto, Harumasa Yoneda, Kenichi Morita, Katsunobu Imai
    A Time Hierarchy Theorem for Nondeterministic Cellular Automata. [Citation Graph (0, 0)][DBLP]
    TAMC, 2007, pp:511-520 [Conf]
  46. Chuzo Iwamoto, Naoki Hatayama, Yoshiaki Nakashiba, Kenichi Morita, Katsunobu Imai
    Translational lemmas for DLOGTIME-uniform circuits, alternating TMs, and PRAMs. [Citation Graph (0, 0)][DBLP]
    Acta Inf., 2007, v:44, n:5, pp:345-359 [Journal]

  47. Computing by Swarm Networks. [Citation Graph (, )][DBLP]


  48. An Asynchronous Cellular Automaton Implementing 2-State 2-Input 2-Output Reversed-Twin Reversible Elements. [Citation Graph (, )][DBLP]


  49. Computational Complexity of Cast Puzzles. [Citation Graph (, )][DBLP]


  50. On Reversibility and Determinism in P Systems. [Citation Graph (, )][DBLP]


  51. Computation with competing patterns in Life-like automaton. [Citation Graph (, )][DBLP]


Search in 0.018secs, Finished in 0.022secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002