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

Research output per year

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

研究成果

2019

Decomposition and factorization of chemical reaction transducers

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

研究成果: Article

2018

Computing with multisets: A survey on reaction automata theory

Yokomori, T. & Okubo, F., 2018 1 1, Sailing Routes in the World of Computation - 14th Conference on Computability in Europe, CiE 2018, Proceedings. Springer-Verlag, p. 421-431 11 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); 巻数 10936 LNCS).

研究成果: Conference contribution

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

Molecular computing machineries-computing models and wet implementations

Hagiya, M., Kobayashi, S., Komiya, K., Tanaka, F. & Yokomori, T., 2012 1 1, Handbook of Natural Computing. Springer Berlin Heidelberg, 巻 3-4. p. 1130-1184 55 p.

研究成果: Chapter

1 引用 (Scopus)

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

On spiking neural P systems

Ibarra, O. H., Pérez-Jiménez, M. J. & Yokomori, T., 2010 6 1, : : Natural Computing. 9, 2, p. 475-491 17 p.

研究成果: Review article

5 引用 (Scopus)

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)

Foreword

Mao, C. & Yokomori, T., 2008 6 1, : : Natural Computing. 7, 2, p. 145-146 2 p.

研究成果: Editorial

Preface

Ionescu, M., Pǎun, G. & Yokomori, T., 2008 4 23, : : Natural Computing. 7, 4, p. 451-452 2 p.

研究成果: Editorial

13 引用 (Scopus)

Representations and characterizations of languages in chomsky hierarchy by means of insertion-deletion systems

Pǎun, G., Pérez-Jiménez, M. J. & Yokomori, T., 2007 1 1, Descriptional Complexity of Formal Systems - 9th International Workshop, DCFS 2007. Technical University of Kosice, p. 129-140 12 p. (Descriptional Complexity of Formal Systems - 9th International Workshop, DCFS 2007).

研究成果: Conference contribution

1 引用 (Scopus)

Linearizer and doubler: Two mappings to unify molecular computing models based on DNA complementarity

Onodera, K. & Yokomori, T., 2006 7 13, DNA Computing - 11th International Workshop on DNA Computing, DNA11, Revised Selected Papers. p. 224-235 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); 巻数 3892 LNCS).

研究成果: Conference contribution

2 引用 (Scopus)

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)
13 引用 (Scopus)

On the power of membrane division in P systems

Pǎun, G., Suzuki, Y., Tanaka, H. & Yokomori, T., 2004 9 16, : : Theoretical Computer Science. 324, 1, p. 61-85 25 p.

研究成果: Conference article

40 引用 (Scopus)
2003

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)
16 引用 (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)

Locality, reversibility, and beyond: Learning languages from positive data

Head, T., Kobayashi, S. & Yokomori, T., 1998 1 1, Algorithmic Learning Theory - 9th International Conference, ALT 1998, Proceedings. Richter, M. M., Wiehagen, R., Smith, C. H. & Zeugmann, T. (版). Springer Verlag, p. 191-204 14 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); 巻数 1501).

研究成果: Conference contribution

8 引用 (Scopus)
1997

DNA implementation of simple horn clause computation

Kobayashi, S., Yokomori, T., Sampei, G. I. & Mizobuchi, K., 1997 1 1, p. 213-217. 5 p.

研究成果: Paper

8 引用 (Scopus)

Identiflability of subspaces and homomorphic images of zero-reversible languages

Kobayashi, S. & Yokomori, T., 1997, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Springer Verlag, 巻 1316. p. 48-61 14 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); 巻数 1316).

研究成果: Conference contribution

10 引用 (Scopus)

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)

On the power of circular splicing systems and DNA computability

Yokomori, T., Kobayashi, S. & Ferretti, C., 1997 1 1, p. 219-224. 6 p.

研究成果: Paper

15 引用 (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
19 引用 (Scopus)

Learning local languages and its application to protein α-chain identification

Yokomori, T., Ishida, N. & Kobayashi, S., 1995 1 1, Proceedings of the Hawaii International Conference on System Sciences. Nunamaker, J. F. & Sprague, R. H. J. (版). Publ by IEEE, p. 113-122 10 p. (Proceedings of the Hawaii International Conference on System Sciences; 巻数 5).

研究成果: Conference contribution

13 引用 (Scopus)