• 1467 引用
  • 15 h指数
1980 …2019
Pureに変更を加えた場合、すぐここに表示されます。

研究成果 1980 2019

  • 1467 引用
  • 15 h指数
  • 52 Article
  • 19 Conference contribution
  • 1 Chapter
  • 1 Editorial
フィルター
Article
2019

Decomposition and factorization of chemical reaction transducers

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

研究成果: Article

Factorization
Transducer
Chemical Reaction
Chemical reactions
Transducers
2017
1 引用 (Scopus)
Context free languages
Formal languages
Stars
Chemical reactions
Star
2015
2 引用 (Scopus)
Multiset
Finite Automata
Finite automata
Tapes
Data storage equipment
6 引用 (Scopus)

The computational capability of chemical reaction automata

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

研究成果: Article

Chemical reactions
Turing machines
Petri nets
2014
3 引用 (Scopus)
Chemical Reaction
Automata
Chemical reactions
Turing machines
Computing
2012
7 引用 (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

Automata
Context sensitive languages
Formal languages
Language
Class
13 引用 (Scopus)

Reaction automata

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

研究成果: Article

Automata
Computing
Multiset
Space Complexity
Turing
2011
2 引用 (Scopus)
Stars
Context free languages

On the hairpin incompletion

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

研究成果: Article

Formal languages
Molecular biology
Completion
Closed
Regular Sets
9 引用 (Scopus)

Spiking neural dP systems

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

研究成果: Article

P Systems
Neurons
Membranes
Spike
Membrane Computing
2010
5 引用 (Scopus)

On spiking neural P systems

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

研究成果: Article

Transducers
Finite automata
Formal verification
10 引用 (Scopus)

Some remarks on the hairpin completion

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

研究成果: Article

Formal languages
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

Membrane Computing
Schema
Insertion
Strings
Membranes
25 引用 (Scopus)

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

Context free languages
Completion
DNA
Context-free Languages
Biochemistry
2008
1 引用 (Scopus)
DNA

Foreword

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

研究成果: Article

Preface

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

研究成果: Article

13 引用 (Scopus)
Context free languages
Stars
Formal languages
Linguistics
DNA
495 引用 (Scopus)

Spiking neural P systems

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

研究成果: Article

P Systems
Neurons
Spike
Neuron
Membrane Computing
2005
4 引用 (Scopus)

A simple classification of the volvocine algae by formal languages

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

研究成果: Article

algae
Formal languages
Algae
Formal Languages
Volvox
2004
7 引用 (Scopus)
Efficient Algorithms
Testing
DNA sequences
Secondary Structure
DNA Sequence
39 引用 (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.

研究成果: Article

P Systems
Division
Membrane
Membranes
Linear Time
2003
22 引用 (Scopus)

On the computational power of insertion-deletion systems

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

研究成果: Article

Molecular biology
RNA
DNA
Genes
Processing
16 引用 (Scopus)
RNA Editing
Molecular biology
Insertional Mutagenesis
Gene Deletion
RNA
37 引用 (Scopus)
Grammar
Polynomial time
Polynomials
Context free grammars
Formal languages
2001
23 引用 (Scopus)

Hairpin languages

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

研究成果: Article

Molecules
DNA
2000
315 引用 (Scopus)

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

Molecular Computers
Single-Stranded DNA
Molecular Biology
DNA
2 引用 (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

Turing machines
Universality
Turing Machine
Multiplicity
7 引用 (Scopus)

Simulating H systems by P systems

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

研究成果: Article

P Systems
Membrane structures
DNA
Membranes
Membrane Computing
128 引用 (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

Structure Prediction
RNA
Grammar
RNA Secondary Structure
Parsing
1998
28 引用 (Scopus)
DNA sequences
Sequence Analysis
DNA Sequence
Amino acids
Amino Acid Sequence
1997
27 引用 (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

Formal languages
Regular Languages
Learning algorithms
Identifiability
Gold
1996
2 引用 (Scopus)
Context free languages
Context free grammars
Formal languages
Polynomials
5 引用 (Scopus)
Deterministic Finite Automata
Finite automata
Tapes
Automata
Counterexample
2 引用 (Scopus)
Deterministic Finite Automata
Finite automata
Tapes
Automata
Counterexample
1995
37 引用 (Scopus)
Polynomials
Finite automata
Learning algorithms

Preface

Arikawa, S., Miyano, S. & Yokomori, T., 1995 1 9, : : Theoretical Computer Science. 137, 1, p. 1 1 p.

研究成果: Article

1991

Introduction: Special issue on algorithmic learning theory

Arikawa, S., Jantke, K. P. & Yokomori, T., 1991 12, : : New Generation Computing. 8, 4, p. 277-280 4 p.

研究成果: Article

Learning Theory
1988
3 引用 (Scopus)
Context free languages
Inductive Inference
Context-free Languages
Context free grammars
Context-free Grammar
1987
3 引用 (Scopus)
Context free languages
Context-free Languages
Divides
Coding
Homomorphism
Logic programming
Logic Programming
Predicate
Computer programming languages
Programming Languages
1986
6 引用 (Scopus)

Logic program forms

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

研究成果: Article

Logic Programs
Recursively Enumerable Languages
Form
Skeleton
Reasoning

Report on IJCAI-85

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

研究成果: Article

1984
3 引用 (Scopus)

An Inverse Homomorphic Characterization of Full Principal AFL

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

研究成果: Article

Homomorphic
Substitution reactions
Homomorphism
Coding
Immediately
1983
1 引用 (Scopus)

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

1982
11 引用 (Scopus)

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

L-system
Normal Form
Theorem
Language