• 1487 引用
  • 15 h指数
1980 …2019

Research output per year

Pureに変更を加えた場合、すぐここに表示されます。

研究成果

フィルター
Article
2019

Decomposition and factorization of chemical reaction transducers

Okubo, F. & Yokomori, T., 2019 1 1, (Accepted/In press) : : Theoretical Computer Science.

研究成果: Article

2017
1 引用 (Scopus)
2015
2 引用 (Scopus)

The computational capability of chemical reaction automata

Okubo, F. & Yokomori, T., 2015 6 2, (Accepted/In press) : : Natural Computing.

研究成果: Article

6 引用 (Scopus)
2014
3 引用 (Scopus)
2012

On the properties of language classes defined by bounded reaction automata

Okubo, F., Kobayashi, S. & Yokomori, T., 2012 10 5, : : Theoretical Computer Science. 454, p. 206-221 16 p.

研究成果: Article

7 引用 (Scopus)

Reaction automata

Okubo, F., Kobayashi, S. & Yokomori, T., 2012 4 20, : : Theoretical Computer Science. 429, p. 247-257 11 p.

研究成果: Article

13 引用 (Scopus)
2011
2 引用 (Scopus)

On the hairpin incompletion

Okubo, F. & Yokomori, T., 2011 9 20, : : Fundamenta Informaticae. 110, 1-4, p. 255-269 15 p.

研究成果: Article

Spiking neural dP systems

Ionescu, M., Pǎun, G., Pérez-Jiménez, M. J. & Yokomori, T., 2011 12 1, : : Fundamenta Informaticae. 111, 4, p. 423-436 14 p.

研究成果: Article

10 引用 (Scopus)
2010

Some remarks on the hairpin completion

Manea, F., Mitrana, V. & Yokomori, T., 2010 10 1, : : International Journal of Foundations of Computer Science. 21, 5, p. 859-872 14 p.

研究成果: Article

10 引用 (Scopus)
2009

Membrane computing schema: A new approach to computation using string insertions

Pérez-Jiménez, M. J. & Yokomori, T., 2009, : : Natural Computing Series. 9783540888680, p. 293-309 17 p.

研究成果: Article

Two complementary operations inspired by the DNA hairpin formation: Completion and reduction

Manea, F., Mitrana, V. & Yokomori, T., 2009 2 17, : : Theoretical Computer Science. 410, 4-5, p. 417-425 9 p.

研究成果: Article

25 引用 (Scopus)
2008
1 引用 (Scopus)
13 引用 (Scopus)
2006

Spiking neural P systems

Ionescu, M., Pǎun, G. & Yokomori, T., 2006 1 1, : : Fundamenta Informaticae. 71, 2-3, p. 279-308 30 p.

研究成果: Article

507 引用 (Scopus)
2005

A simple classification of the volvocine algae by formal languages

Yoshida, H., Yokomori, T. & Suyama, A., 2005 11 1, : : Bulletin of Mathematical Biology. 67, 6, p. 1339-1354 16 p.

研究成果: Article

4 引用 (Scopus)
2004
7 引用 (Scopus)
2003
16 引用 (Scopus)

On the computational power of insertion-deletion systems

Takahara, A. & Yokomori, T., 2003 12 1, : : Natural Computing. 2, 4, p. 321-336 16 p.

研究成果: Article

22 引用 (Scopus)
37 引用 (Scopus)
2001

Hairpin languages

Pǎun, G., Rozenberg, G. & Yokomori, T., 2001 1 1, : : International Journal of Foundations of Computer Science. 12, 6, p. 837-847 11 p.

研究成果: Article

23 引用 (Scopus)
2000

Molecular computation by DNA hairpin formation

Sakamoto, K., Gouzu, H., Komiya, K., Kiga, D., Yokoyama, S., Yokomori, T. & Hagiya, M., 2000 5 19, : : Science. 288, 5469, p. 1223-1226 4 p.

研究成果: Article

320 引用 (Scopus)

On the universality of Post and splicing systems

Ferretti, C., Mauri, G., Kobayashi, S. & Yokomori, T., 2000 1 28, : : Theoretical Computer Science. 231, 2, p. 157-170 14 p.

研究成果: Article

公開
2 引用 (Scopus)

Simulating H systems by P systems

Pǎun, G. & Yokomori, T., 2000 1 1, : : Journal of Universal Computer Science. 6, 1, p. 178-193 16 p.

研究成果: Article

7 引用 (Scopus)

Tree adjoining grammars for RNA structure prediction

Uemura, Y., Hasegawa, A., Kobayashi, S. & Yokomori, T., 1999 1 17, : : Theoretical Computer Science. 210, 2, p. 277-303 27 p.

研究成果: Article

公開
129 引用 (Scopus)
1998
28 引用 (Scopus)
1997

Learning approximately regular languages with reversible languages

Kobayashi, S. & Yokomori, T., 1997 3 15, : : Theoretical Computer Science. 174, 1-2, p. 251-257 7 p.

研究成果: Article

公開
27 引用 (Scopus)
1996

Inductive inference of monogenic pure context-free languages

Tanida, N. & Yokomori, T., 1996 1 1, : : IEICE Transactions on Information and Systems. E79-D, 11, p. 1503-1510 8 p.

研究成果: Article

2 引用 (Scopus)
5 引用 (Scopus)
2 引用 (Scopus)
1995
公開
37 引用 (Scopus)
1988
3 引用 (Scopus)
1987
3 引用 (Scopus)
1986

Logic program forms

Yokomori, T., 1986 9 1, : : New Generation Computing. 4, 3, p. 305-319 15 p.

研究成果: Article

6 引用 (Scopus)

Report on IJCAI-85

Yokomori, T., 1986 3 1, : : New Generation Computing. 4, 1, p. 107-108 2 p.

研究成果: Article

1984

An Inverse Homomorphic Characterization of Full Principal AFL

Yokomori, T. & Wood, D., 1984 9, : : Information Sciences. 33, 3, p. 209-215 7 p.

研究成果: Article

3 引用 (Scopus)
1983

Semi-linearity, parikh-boundedness and tree adjunct languages

Yokomori, T. & Joshi, A. K., 1983 10 5, : : Information Processing Letters. 17, 3, p. 137-143 7 p.

研究成果: Article

1 引用 (Scopus)
1982

A three-restricted normal form theorem for ETOL languages

Yokomori, T., Wood, D. & Lange, K. J., 1982 5 16, : : Information Processing Letters. 14, 3, p. 97-100 4 p.

研究成果: Article

11 引用 (Scopus)
1980

Stochastic characterizations of E0L languages

Yokomori, T., 1980 4, : : Information and Control. 45, 1, p. 26-33 8 p.

研究成果: Article

12 引用 (Scopus)