2008 |
13 | EE | Susumu Adachi,
Ferdinand Peper,
Jia Lee,
Hiroshi Umeo:
Occurrence of Gliders in an Infinite Class of Life-Like Cellular Automata.
ACRI 2008: 32-41 |
12 | EE | 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 |
2007 |
11 | EE | Jia Lee,
Susumu Adachi,
Ferdinand Peper:
Reliable Self-Replicating Machines in Asynchronous Cellular Automata.
Artificial Life 13(4): 397-413 (2007) |
2005 |
10 | EE | Jia Lee,
Susumu Adachi,
Ferdinand Peper,
Shinro Mashiko:
Delay-insensitive computation in asynchronous cellular automata.
J. Comput. Syst. Sci. 70(2): 201-220 (2005) |
2004 |
9 | EE | Ferdinand Peper,
Kazuhiro Oiwa,
Susumu Adachi,
Chikako Shingyoji,
Jia Lee:
Synchronization of Protein Motors Modeled by Asynchronous Cellular Automata.
ACRI 2004: 571-580 |
8 | EE | Susumu Adachi,
Ferdinand Peper,
Jia Lee:
Universality of Hexagonal Asynchronous Totalistic Cellular Automata.
ACRI 2004: 91-100 |
7 | EE | 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) |
2003 |
6 | EE | Jia Lee,
Susumu Adachi,
Ferdinand Peper,
Kenichi Morita:
Embedding Universal Delay-Insensitive Circuits in Asynchronous Cellular Spaces.
Fundam. Inform. 58(2003): 295-320 (2003) |
5 | 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 |
4 | EE | Jia Lee,
Ferdinand Peper,
Susumu Adachi,
Kenichi Morita,
Shinro Mashiko:
Reversible Computation in Asynchronous Cellular Automata.
UMC 2002: 220-229 |
2001 |
3 | | Jia Lee,
Kenichi Morita:
Generation and Parsing of Morphism Languages by Uniquely Parallel Parsable Grammars.
Words, Semigroups, and Transductions 2001: 303-314 |
2000 |
2 | | 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 |
1 | | Jia Lee,
Kenichi Morita,
Hiroki Asou,
Katsunobu Imai:
Uniquely Parsable Unification Grammars and Their Parser Implemented in Prolog.
Grammars 3(1): 63-81 (2000) |