Takashi Yokomori

Satoshi Kobayashi, Takashi Yokomori, Nobuyuki Ishida, 1994, 1994 Proceedings of the Twenty-Seventh Hawaii International Conference on System Sciences.

Grammatically Modeling and Predicting RNA Secondary Structures

Satoshi Kobayashi, Takashi Yokomori, Aki Hasegawa, 1995 .

Simulating H Systems by P Systems

Gheorghe Paun, Takashi Yokomori, 2000, J. Univers. Comput. Sci..

Computing with Multisets: A Survey on Reaction Automata Theory

Takashi Yokomori, Fumiya Okubo, 2018, CiE.

Representations and Characterizations of Languages in Chomsky Hierarchy by Means of Insertion-Deletion Systems

Gheorghe Paun, Takashi Yokomori, Mario J. Pérez-Jiménez, 2008, Int. J. Found. Comput. Sci..

Foreword

Takashi Yokomori, Chengde Mao, 2007, Natural Computing.

Proceedings of the 10th International Conference on Algorithmic Learning Theory

Osamu Watanabe, Takashi Yokomori, T. Yokomori, 1999 .

Automata inspired by biochemical reaction (New Trends in Algorithms and Theory of Computation)

Satoshi Kobayashi, Takashi Yokomori, Fumiya Okubo, 2012 .

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

Takashi Yokomori, T. Yokomori, 1988, New Generation Computing.

Modeling RNA Secondary Structures Using Tree Grammars

Satoshi Kobayashi, Takashi Yokomori, T. Yokomori, 1994 .

Logic program forms

Takashi Yokomori, 2009, New Generation Computing.

A Note on the Set Abstraction in Logic Programming Language

Takashi Yokomori, 1984, FGCS.

Molecular computing paradigm – toward freedom from Turing's charm

Takashi Yokomori, T. Yokomori, 2002, Natural Computing.

Inductive Inference of 0L Languages

Takashi Yokomori, 1992 .

Natural Computing Paradigm • A Concise Introduction

Takashi Yokomori, 2018, J. Robotics Netw. Artif. Life.

Introduction to the session: Computing with biomolecules

Takashi Yokomori, Tom Head, 1996 .

Erratum to "Polynomial-time identification of very simple grammars from positive data" [Theoret. Comput. Science 298 (2003) 179-206]

Takashi Yokomori, 2007, Theor. Comput. Sci..

Algorithmic Learning Theory: 10th International Conference, ALT '99 Tokyo, Japan, December 6-8, 1999 Proceedings

Osamu Watanabe, Takashi Yokomori, 2000 .

The Computational Capability of Chemical Reaction Automata

Takashi Yokomori, Fumiya Okubo, 2014, DNA.

On spiking neural P systems

Oscar H. Ibarra, Takashi Yokomori, Mario J. Pérez-Jiménez, 2006, Natural Computing.

Spiking Neural P Systems with an Exhaustive Use of Rules

Gheorghe Paun, Takashi Yokomori, Mihai Ionescu, 2007, Int. J. Unconv. Comput..

On Purely Morphic Characterizations of Context-Free Languages

Takashi Yokomori, T. Yokomori, 1987, Theor. Comput. Sci..

Finite Automata with Multiset Memory: A New Characterization of Chomsky Hierarchy

Takashi Yokomori, Fumiya Okubo, 2015, Fundam. Informaticae.

On polynomial-time learnability in the limit of strictly deterministic automata

Takashi Yokomori, 1995, Machine Learning.

Polynomial-time identification of very simple grammars from positive data

Takashi Yokomori, T. Yokomori, 2003, Theor. Comput. Sci..

Morphic Characterizations of Language Families in Terms of Insertion Systems and Star Languages

Takashi Yokomori, Fumiya Okubo, 2011, Int. J. Found. Comput. Sci..

Membrane computing based on splicing

Gheorghe Paun, Takashi Yokomori, 1999, DNA Based Computers.

Molecular Computing Machineries - Computing Models and Wet Implementations

Satoshi Kobayashi, Takashi Yokomori, Masami Hagiya, 2012, Handbook of Natural Computing.

Special Issue on Algorithmic Learning Theory

Takashi Yokomori, 1995 .

Tree Adjoining Grammars for RNA Structure Prediction

Satoshi Kobayashi, Takashi Yokomori, Aki Hasegawa, 1999, Theor. Comput. Sci..

Algorithmic Learning Theory: 4th International Workshop, ALT '93, Tokyo, Japan, November 8-10, 1993 - Proceedings

Shigenobu Kobayashi, Takashi Yokomori, Etsuji Tomita, 1993 .

Toward Soft Hardware

Gheorghe Paun, Takashi Yokomori, 2001, Soft Comput..

On the power of membrane division in P systems

Gheorghe Paun, Takashi Yokomori, Yasuhiro Suzuki, 2004, Theor. Comput. Sci..

Learning Context-Free Languages Efficiently - A Report on Recent Results in Japan

Takashi Yokomori, 1989, AII.

Proceedings of the 12th international conference on DNA Computing

Takashi Yokomori, Chengde Mao, 2006 .

Identifiability of Subspaces and Homomorphic Images of Zero-Reversible Languages

Satoshi Kobayashi, Takashi Yokomori, 1997, ALT.

Corrigendum Learning Two-Type Automata from Queries and Counterexamples

Takashi Yokomori, 2002, Theory of Computing Systems.

SINGLE QUEUE COMPILATION IN EXTENDED CONCURRENT PROLOG

Jiro Tanaka, Takashi Yokomori, Makoto Kishishita, 1986 .

Families of Noncounting Languages and Their Learnability from Positive Data

Takashi Yokomori, Satoshi Kobayashi, 1996, Int. J. Found. Comput. Sci..

Learning two-tape automata from queries and counterexamples

Takashi Yokomori, 1993, COLT '93.

Approximate identification of finite elasticity

Satoshi Kobayashi, Takashi Yokomori, Yasubumi Sakakibara, 2001, Where Mathematics, Computer Science, Linguistics and Biology Meet.

On the power of circular splicing systems and DNA computability

Satoshi Kobayashi, Takashi Yokomori, Claudio Ferretti, 1997, Proceedings of 1997 IEEE International Conference on Evolutionary Computation (ICEC '97).

An Algorithm for Testing Structure Freeness of Biomolecular Sequences

Satoshi Kobayashi, Takashi Yokomori, Yasubumi Sakakibara, 2004, Aspects of Molecular Computing.

Graph-Controlled Systems — An Extension of OL systems

Takashi Yokomori, 1986 .

Polynomial-time MAT Learning of C-Deterministic Context-free Grammars

Takashi Yokomori, Hiromi Shirakawa, T. Yokomori, 1993 .

A Three-Restricted Normal Form Theorem for ET0L Languages

Derick Wood, Takashi Yokomori, Klaus-Jörn Lange, 1982, Inf. Process. Lett..

Computation = self-assembly + conformational change: toward new computing paradigms

Takashi Yokomori, T. Yokomori, 2000, Developments in Language Theory.

Stochastic Characterizations of EOL Languages

Takashi Yokomori, T. Yokomori, 1980, Inf. Control..