dblp.uni-trier.dewww.uni-trier.de

Katsunobu Imai Vis

List of publications from the DBLP Bibliography Server - FAQ
Coauthor Index - Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo

*2009
29EENaonori 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
28EENaonori Tanimoto, Katsunobu Imai: A Construction Method of Moore Neighborhood Number-Conserving Cellular Automata. ACRI 2008: 244-251
27EEKatsunobu Imai, Bruno Martin: Simulations between triangular and hexagonal number-conserving cellular automata CoRR abs/0809.0355: (2008)
26EEChuzo Iwamoto, Harumasa Yoneda, Kenichi Morita, Katsunobu Imai: A Recursive Padding Technique on Nondeterministic Cellular Automata. IEICE Transactions 91-A(9): 2335-2340 (2008)
2007
25EEChuzo Iwamoto, Harumasa Yoneda, Kenichi Morita, Katsunobu Imai: A Time Hierarchy Theorem for Nondeterministic Cellular Automata. TAMC 2007: 511-520
24EEChuzo 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)
2005
23EEChuzo Iwamoto, Yoshiaki Nakashiba, Kenichi Morita, Katsunobu Imai: Translational Lemmas for Alternating TMs and PRAMs. FCT 2005: 137-148
2004
22EEChuzo Iwamoto, Naoki Hatayama, Kenichi Morita, Katsunobu Imai, Daisuke Wakamatsu: Hierarchies of DLOGTIME-Uniform Circuits. MCU 2004: 211-222
2003
21EEChuzo Iwamoto, Katsuyuki Tateishi, Kenichi Morita, Katsunobu Imai: Simulations Between Multi-dimensional Deterministic and Alternating Cellular Automata. Fundam. Inform. 58(2003): 261-271 (2003)
20EEJia 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
19EEChuzo Iwamoto, Takeshi Andou, Kenichi Morita, Katsunobu Imai: Computational Complexity in the Hyperbolic Plane. MFCS 2002: 365-374
18EEKatsunobu 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
17EEChuzo Iwamoto, Katsuyuki Tateishi, Kenichi Morita, Katsunobu Imai: A quadratic speedup theorem for iterative arrays. Acta Inf. 38(11/12): 847-858 (2002)
16 Katsunobu Imai, Takahiro Hori, Kenichi Morita: Self-Reproduction in Three-Dimensional Reversible Cellular Space. Artificial Life 8(2): 155-174 (2002)
15EEKatsunobu Imai, Kenichi Morita, Kenji Sako: Firing Squad Synchronization Problem in Number-Conserving Cellular Automata. Fundam. Inform. 52(1-3): 133-141 (2002)
14EEChuzo 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
13EEChuzo Iwamoto, Katsuyuki Tateishi, Kenichi Morita, Katsunobu Imai: Speeding-Up Cellular Automata by Alternations. MCU 2001: 240-251
12EEKatsunobu 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: (2001)
11EEKenichi Morita, Katsunobu Imai: Number-Conserving Reversible Cellular Automata and Their Computation-Universality. ITA 35(3): 239-258 (2001)
2000
10 Jia Lee, Kenichi Morita, Hiroki Asou, Katsunobu Imai: Uniquely Parsable Unification Grammars and Their Parser Implemented in Prolog. Grammars 3(1): 63-81 (2000)
9EEKatsunobu Imai, Kenichi Morita: A computation-universal two-dimensional 8-state triangular reversible cellular automaton. Theor. Comput. Sci. 231(2): 181-191 (2000)
1999
8EEChuzo Iwamoto, Tomonobu Hatsuyama, Kenichi Morita, Katsunobu Imai: On Time-Constructible Functions in One-Dimensional Cellular Automata. FCT 1999: 316-326
7 Kenichi Morita, Satoshi Ueno, Katsunobu Imai: Characterizing the Ability of Parallel Array Generators on Reversible Partitioned Cellular Automata. IJPRAI 13(4): 523-538 (1999)
6 Kenichi Morita, Maurice Margenstern, Katsunobu Imai: Universality of Reversible Hexagonal Cellular Automata. ITA 33(6): 535-550 (1999)
5EEKenichi Morita, Katsunobu Imai: Uniquely parsable array grammars for generating and parsing connected patterns. Pattern Recognition 32(2): 269-276 (1999)
1998
4 Katsunobu Imai, Kenichi Morita: A computation-universal two-dimensional 8-state triangular reversible cellular automaton. MCU (2) 1998: 90-99
1996
3 Kenichi Morita, Katsunobu Imai: Logical Universality and Self-Reproduction in Reversible Cellular Automata. ICES 1996: 152-166
2EEKatsunobu Imai, Kenichi Morita: Firing Squad Synchronization Problem in Reversible Cellular Automata. Theor. Comput. Sci. 165(2): 475-482 (1996)
1EEKenichi Morita, Katsunobu Imai: Self-Reproduction in a Reversible Cellular Space. Theor. Comput. Sci. 168(2): 337-366 (1996)

Coauthor Index

1Takeshi Andou [19]
2Hiroki Asou [10]
3Kenji Fujita [18]
4Naoki Hatayama [22] [24]
5Tomonobu Hatsuyama [8] [14]
6Takahiro Hori [16]
7Chuzo Iwamoto [8] [12] [13] [14] [17] [18] [19] [21] [22] [23] [24] [25] [26] [29]
8Jia Lee [10] [20]
9Maurice Margenstern [6]
10Bruno Martin [27]
11Yukio Matsuda [12]
12Kenichi Morita [1] [2] [3] [4] [5] [6] [7] [8] [9] [10] [11] [12] [13] [14] [15] [16] [17] [18] [19] [20] [21] [22] [23] [24] [25] [26] [29]
13Yoshiaki Nakashiba [23] [24]
14Kenji Sako [15]
15Naonori Tanimoto [28] [29]
16Katsuyuki Tateishi [13] [17] [21]
17Satoshi Ueno [7]
18Daisuke Wakamatsu [22]
19Harumasa Yoneda [25] [26]

Colors in the list of coauthors

Copyright © Tue Nov 3 08:52:44 2009 by Michael Ley (ley@uni-trier.de)