2008 |
28 | EE | Naonori Tanimoto,
Katsunobu Imai:
A Construction Method of Moore Neighborhood Number-Conserving Cellular Automata.
ACRI 2008: 244-251 |
27 | EE | Katsunobu Imai,
Bruno Martin:
Simulations between triangular and hexagonal number-conserving cellular automata
CoRR abs/0809.0355: (2008) |
26 | EE | Chuzo Iwamoto,
Harumasa Yoneda,
Kenichi Morita,
Katsunobu Imai:
A Recursive Padding Technique on Nondeterministic Cellular Automata.
IEICE Transactions 91-A(9): 2335-2340 (2008) |
2007 |
25 | EE | Chuzo Iwamoto,
Harumasa Yoneda,
Kenichi Morita,
Katsunobu Imai:
A Time Hierarchy Theorem for Nondeterministic Cellular Automata.
TAMC 2007: 511-520 |
24 | EE | 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) |
2005 |
23 | EE | Chuzo Iwamoto,
Yoshiaki Nakashiba,
Kenichi Morita,
Katsunobu Imai:
Translational Lemmas for Alternating TMs and PRAMs.
FCT 2005: 137-148 |
2004 |
22 | EE | Chuzo Iwamoto,
Naoki Hatayama,
Kenichi Morita,
Katsunobu Imai,
Daisuke Wakamatsu:
Hierarchies of DLOGTIME-Uniform Circuits.
MCU 2004: 211-222 |
2003 |
21 | EE | Chuzo Iwamoto,
Katsuyuki Tateishi,
Kenichi Morita,
Katsunobu Imai:
Simulations Between Multi-dimensional Deterministic and Alternating Cellular Automata.
Fundam. Inform. 58(2003): 261-271 (2003) |
20 | EE | 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 |
19 | EE | Chuzo Iwamoto,
Takeshi Andou,
Kenichi Morita,
Katsunobu Imai:
Computational Complexity in the Hyperbolic Plane.
MFCS 2002: 365-374 |
18 | EE | 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 |
17 | EE | Chuzo 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) |
15 | EE | Katsunobu Imai,
Kenichi Morita,
Kenji Sako:
Firing Squad Synchronization Problem in Number-Conserving Cellular Automata.
Fundam. Inform. 52(1-3): 133-141 (2002) |
14 | EE | 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 |
13 | EE | Chuzo Iwamoto,
Katsuyuki Tateishi,
Kenichi Morita,
Katsunobu Imai:
Speeding-Up Cellular Automata by Alternations.
MCU 2001: 240-251 |
12 | EE | 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: (2001) |
11 | EE | Kenichi 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) |
9 | EE | Katsunobu Imai,
Kenichi Morita:
A computation-universal two-dimensional 8-state triangular reversible cellular automaton.
Theor. Comput. Sci. 231(2): 181-191 (2000) |
1999 |
8 | EE | Chuzo 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) |
5 | EE | Kenichi 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 |
2 | EE | Katsunobu Imai,
Kenichi Morita:
Firing Squad Synchronization Problem in Reversible Cellular Automata.
Theor. Comput. Sci. 165(2): 475-482 (1996) |
1 | EE | Kenichi Morita,
Katsunobu Imai:
Self-Reproduction in a Reversible Cellular Space.
Theor. Comput. Sci. 168(2): 337-366 (1996) |