Satoshi Kobayashi, Associate Professor

University of Electro-Communications

Depertment of Computer Science

Building W9, Room 735

1-5-1, Chofugaoka, Chofu,

Tokyo 182-8585, JAPAN

Dr. Satoshi Kobayashi has been associated with the Univ. of Electro-Communications since 2000. He received his Dr.E. degree from the University of Tokyo in 1993. His research intrests include computational learning theory, formal language theory, theory of molecular computing, and bioinformatics.

Current Research Topics: 1) grammatical inference, 2) design and analysis of molecular reaction systems for DNA computing, 3) sequence design for DNA computing, 4) grammatical modeling of RNA secondary structures, 5) alignment of RNA secondary structures

Some Recent Publications:

Satoshi Kobayashi, Testing Structure Freeness of Regular Sets of Biomolecular Sequences, Preliminary Proceedings of 10th International Meeting on DNA Based Computers, pp.395-404, 2004.
Kazuya Nagatsu, Atsushi Kijima, Satoshi Kobayashi, Evaluating Biomolecular Sequences Using Hydrogen Bond Network Graph, Preliminary Proceedings of 10th International Meeting on DNA Based Computers, p.441, 2004.
Shinnosuke Seki, Satoshi Kobayashi, Efficient Learning of k-reversible Context Free Grammars from Positive Structural Examples, Proc. of ICGI'2004, LNAI 3264, p.285-287, 2004.
Satoshi Kobayashi, Takashi Yokomori, Yasubumi Sakakibara, An Algorithm for Testing Structure Freeness of Biomolecular Sequences, Aspects of Molecular Computing, Essays Dedicated to Tom Head on the Occasion of His 70th Birthday, Lecture Notes in Computer Science, 2950, pp.266-277, 2003.
Satoshi Kobayashi, Structure Free Sequences for Biomolecular Computing, The 990th American Mathematical Society Fall Eastern Sectional Meeting, p.80, 2003. (invited)
Satoshi Kobayashi, Tomohiro Kondo, Kohei Okuda, Etsuji Tomita, Extracting Globally Structure Free Sequences by Local Structure Freeness, Preliminary Proc. of 9th International Meeting on DNA Based Computer, p.206, 2003.
Satoshi Kobayashi, Tomohiro Kondo, Kohei Okuda, Etsuji Tomita, A Method for Extracting Globally Structure Free Set of Sequences, Technical Report of IEICE, COMP-2003-16, pp.1-6, 2003.
Satoshi Kobayashi, Tomohiro Kondo, Kohei Okuda, and Masanori Arita, On Template Method for DNA Sequence Design, 8th International Meeting on DNA Computers, LNCS 2568, pp.205-214, 2002.
Masanori Arita and Satoshi Kobayashi, DNA Sequence Design Using Templates, New Generation Computing, 20, pp.263-277, 2002.
Takashi Yokomori, Yasubumi Sakakibara, Satoshi Kobayashi, A Magic Pot : Self-assembly computation revisited, Formal and Natural Computing, LNCS 2300, pp.418-429, 2002.
Satoshi Kobayashi, Yasubumi Sakakibara, Takashi Yokomori, Approximate Identification and Finite Elasticity, in Where Mathematics, Computer Science, Linguistics and Biology Meet, C. Martin-Vide and V. Mitranaieds.jC Kulwer Academic Publishers, pp.277-286, 2001.
Satoshi Kobayashi, Victor Mitrana, Gheorge Paun and Grzegorz Rozenberg, Formal Properties of PA-Matching, Theoretical Computer Science, 262, pp.117-131, 2001.
Yasubumi Sakakibara and Satoshi Kobayashi, Sticker Systems with Complex Structures, Soft Computing, 5, pp.114-120, 2001.
Satoshi Kobayashi, Concentration Prediction of Ligation Reaction Systems, Romanian Journal of Information Science and Technology, 4, pp.101-109, 2001.
Satoshi Kobayashi and Yasubumi Sakakibara, Multiple splicing systems and the universal computability, Theoretical Computer Science, 264, pp.3-23, 2001.
H. Uejima, M. Hagiya, and S. Kobayashi, Horn Clause Computation by Self Assembly of DNA Molecules, Proc. of 7th International Meeting on DNA Based Computers, pp.63-74, 2001.
S. Kobayashi, Iterated Transductions and Efficient Learning from Positive Data:A Unifying View, in Proc. of ICGI 2000, LNAI 1891, pp.157-170, 2000.
C. Ferretti, G. Mauri, Satoshi Kobayashi, and Takashi Yokomori, On the Universality of Post and Splicing Systems, Theoretical Computer Science, 231, pp.157-170, 2000.
Yasuo Uemura, Aki Hasegawa, Satoshi Kobayashi and Takashi Yokomori, Tree Adjoining Grammars for RNA Structure Prediction, Theoretical Computer Science, 210, pp.277-303, 1999.
Satoshi Kobayashi, Horn Clause Computation with DNA Molecules, Journal of Combinatorial Optimization, 3, pp.277-299, 1999.
Takashi Yokomori and Satoshi Kobayashi, Learning Local Languages and Their Application to DNA Sequence Analysis, IEEE Trans. on Pattern Analysis and Machine Intelligence, 20(10), pp.1067-1079, 1998.
Tom Head, Satoshi Kobayashi and Takashi Yokomori, Locality, Reversibility, and Beyond: Learning Languages from Positive Data, Proc. of 9th International Workshop on Algorithmic Learning Theory, Lecture Notes in Artificial Intelligence 1501, Springer-Verlag, pp.191-204, 1998.