• 1498 Citations
  • 15 h-Index
1980 …2019

Research output per year

If you made any changes in Pure these will be visible here soon.

Research Output

Filter
Article
2019

Decomposition and factorization of chemical reaction transducers

Okubo, F. & Yokomori, T., 2019 Jul 19, In : Theoretical Computer Science. 777, p. 431-442 12 p.

Research output: Contribution to journalArticle

2017

Morphic characterizations of language families based on local and star languages

Okubo, F. & Yokomori, T., 2017, In : Fundamenta Informaticae. 154, 1-4, p. 323-341 19 p.

Research output: Contribution to journalArticle

1 Citation (Scopus)
2015

Finite automata with multiset memory: A new characterization of chomsky hierarchy

Okubo, F. & Yokomori, T., 2015, In : Fundamenta Informaticae. 138, 1-2, p. 31-44 14 p.

Research output: Contribution to journalArticle

2 Citations (Scopus)

The computational capability of chemical reaction automata

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

Research output: Contribution to journalArticle

6 Citations (Scopus)
2014
3 Citations (Scopus)
2012

On the properties of language classes defined by bounded reaction automata

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

Research output: Contribution to journalArticle

7 Citations (Scopus)

Reaction automata

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

Research output: Contribution to journalArticle

13 Citations (Scopus)
2011
2 Citations (Scopus)

On the hairpin incompletion

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

Research output: Contribution to journalArticle

Spiking neural dP systems

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

Research output: Contribution to journalArticle

10 Citations (Scopus)
2010

Some remarks on the hairpin completion

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

Research output: Contribution to journalArticle

10 Citations (Scopus)
2009

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

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

Research output: Contribution to journalArticle

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

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

Research output: Contribution to journalArticle

26 Citations (Scopus)
2008

Doubler and linearizer: An approach toward a unified theory for molecular computing based on DNA complementarity

Onodera, K. & Yokomori, T., 2008 Mar 1, In : Natural Computing. 7, 1, p. 125-143 19 p.

Research output: Contribution to journalArticle

1 Citation (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., 2008 Aug 1, In : International Journal of Foundations of Computer Science. 19, 4, p. 859-871 13 p.

Research output: Contribution to journalArticle

13 Citations (Scopus)
2006

Spiking neural P systems

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

Research output: Contribution to journalArticle

512 Citations (Scopus)
2005

A simple classification of the volvocine algae by formal languages

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

Research output: Contribution to journalArticle

4 Citations (Scopus)
2004
7 Citations (Scopus)
2003

On the computational power of insertion-deletion systems

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

Research output: Contribution to journalArticle

22 Citations (Scopus)
16 Citations (Scopus)

Polynomial-time identification of very simple grammars from positive data

Yokomori, T., 2003 Apr 4, In : Theoretical Computer Science. 298, 1, p. 179-206 28 p.

Research output: Contribution to journalArticle

37 Citations (Scopus)
2001

Hairpin languages

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

Research output: Contribution to journalArticle

24 Citations (Scopus)
2000

Molecular computation by DNA hairpin formation

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

Research output: Contribution to journalArticle

324 Citations (Scopus)

On the universality of Post and splicing systems

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

Research output: Contribution to journalArticle

Open Access
2 Citations (Scopus)

Simulating H systems by P systems

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

Research output: Contribution to journalArticle

7 Citations (Scopus)

Tree adjoining grammars for RNA structure prediction

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

Research output: Contribution to journalArticle

Open Access
129 Citations (Scopus)
1998

Learning local languages and their application to DNA sequence analysis

Yokomori, T. & Kobayashi, S., 1998 Dec 1, In : IEEE Transactions on Pattern Analysis and Machine Intelligence. 20, 10, p. 1067-1079 13 p.

Research output: Contribution to journalArticle

28 Citations (Scopus)
1997

Learning approximately regular languages with reversible languages

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

Research output: Contribution to journalArticle

Open Access
27 Citations (Scopus)
1996

Inductive inference of monogenic pure context-free languages

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

Research output: Contribution to journalArticle

2 Citations (Scopus)

Learning two-tape automata from queries and counterexamples

Yokomori, T., 1996 Jan 1, In : Theory of Computing Systems. 29, 3, p. 259-270 12 p.

Research output: Contribution to journalArticle

2 Citations (Scopus)

Learning two-tape automata from queries and counterexamples

Yokomori, T., 1996 May 1, In : Mathematical systems theory. 29, 3, p. 259-270 12 p.

Research output: Contribution to journalArticle

5 Citations (Scopus)
1995

On Polynomial-Time Learnability in the Limit of Strictly Deterministic Automata

Yokomori, T., 1995 May, In : Machine Learning. 19, 2, p. 153-179 27 p.

Research output: Contribution to journalArticle

Open Access
37 Citations (Scopus)
1988

Inductive Inference of Context-free Languages Based on Context-free Expressions

Yokomori, T., 1988 Jan 1, In : International Journal of Computer Mathematics. 24, 2, p. 115-140 26 p.

Research output: Contribution to journalArticle

3 Citations (Scopus)
1987

On purely morphic characterizations of context-free languages

Yokomori, T., 1987, In : Theoretical Computer Science. 51, 3, p. 301-308 8 p.

Research output: Contribution to journalArticle

3 Citations (Scopus)

Set abstraction-An extension of all solutions predicate in logic programming language

Yokomori, T., 1987 Sep 1, In : New Generation Computing. 5, 3, p. 227-248 22 p.

Research output: Contribution to journalArticle

1986

Logic program forms

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

Research output: Contribution to journalArticle

6 Citations (Scopus)

Report on IJCAI-85

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

Research output: Contribution to journalArticle

1984

An Inverse Homomorphic Characterization of Full Principal AFL

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

Research output: Contribution to journalArticle

3 Citations (Scopus)
1983

Semi-linearity, parikh-boundedness and tree adjunct languages

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

Research output: Contribution to journalArticle

1 Citation (Scopus)
1982

A three-restricted normal form theorem for ETOL languages

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

Research output: Contribution to journalArticle

11 Citations (Scopus)
1980

Stochastic characterizations of E0L languages

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

Research output: Contribution to journalArticle

12 Citations (Scopus)