# Takashi Yokomori

According to our database

Collaborative distances:

^{1}, Takashi Yokomori authored at least 69 papers between 1980 and 2018.Collaborative distances:

## Timeline

#### Legend:

Book In proceedings Article PhD thesis Other## Links

#### On csauthors.net:

## Bibliography

2018

Natural Computing Paradigm • A Concise Introduction.

JRNAL, 2018

Computing with Multisets: A Survey on Reaction Automata Theory.

Proceedings of the Sailing Routes in the World of Computation, 2018

The Computing Power of Determinism and Reversibility in Chemical Reaction Automata.

Proceedings of the Reversibility and Universality, 2018

2017

Morphic Characterizations of Language Families Based on Local and Star Languages.

Fundam. Inform., 2017

2015

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

Fundam. Inform., 2015

2014

The Computational Capability of Chemical Reaction Automata.

Proceedings of the DNA Computing and Molecular Programming - 20th International Conference, 2014

2012

Molecular Computing Machineries - Computing Models and Wet Implementations.

Proceedings of the Handbook of Natural Computing, 2012

On the properties of language classes defined by bounded reaction automata.

Theor. Comput. Sci., 2012

Reaction automata.

Theor. Comput. Sci., 2012

2011

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

Int. J. Found. Comput. Sci., 2011

On the Hairpin Incompletion.

Fundam. Inform., 2011

Spiking Neural dP Systems.

Fundam. Inform., 2011

2010

On spiking neural P systems.

Natural Computing, 2010

2009

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

Theor. Comput. Sci., 2009

2008

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

Natural Computing, 2008

Foreword.

Natural Computing, 2008

Preface.

Natural Computing, 2008

Some Remarks on the Hairpin Completion.

Proceedings of the Automata and Formal Languages, 12th International Conference, 2008

2007

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

Theor. Comput. Sci., 2007

Spiking Neural P Systems with an Exhaustive Use of Rules.

IJUC, 2007

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

Proceedings of the 9th International Workshop on Descriptional Complexity of Formal Systems - DCFS 2007, High Tatras, Slovakia, July 20, 2007

Probabilistic Inference in Test Tube and its Application to Gene Expression Profiles.

Proceedings of the Formal Models, 2007

2006

Spiking Neural P Systems.

Fundam. Inform., 2006

2005

Linearizer and Doubler : Two Mappings to Unify Molecular Computing Models Based on DNA Complementarity.

Proceedings of the DNA Computing, 11th International Workshop on DNA Computing, 2005

2004

On the power of membrane division in P systems.

Theor. Comput. Sci., 2004

Learning Mild Context-Sensitiveness: Toward Understanding Children's Language Learning.

Proceedings of the Grammatical Inference: Algorithms and Applications, 2004

An Algorithm for Testing Structure Freeness of Biomolecular Sequences.

Proceedings of the Aspects of Molecular Computing, 2004

2003

Polynomial-time identification of very simple grammars from positive data.

Theor. Comput. Sci., 2003

2002

Corrigendum Learning Two-Type Automata from Queries and Counterexamples.

Theory Comput. Syst., 2002

On the Computational Power of Insertion-Deletion Systems.

Proceedings of the DNA Computing, 8th International Workshop on DNA Based Computers, 2002

A Magic Pot : Self-assembly Computation Revisited.

Proceedings of the Formal and Natural Computing, 2002

2001

Toward Soft Hardware.

Soft Comput., 2001

Hairpin Languages.

Int. J. Found. Comput. Sci., 2001

Approximate identification of finite elasticity.

Proceedings of the Where Mathematics, 2001

2000

Simulating H Systems by P Systems.

J. UCS, 2000

1999

Tree Adjoining Grammars for RNA Structure Prediction.

Theor. Comput. Sci., 1999

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

Proceedings of the Developments in Language Theory, 1999

YAC: Yet another computation model of self-assembly.

Proceedings of the DNA Based Computers, 1999

Membrane computing based on splicing.

Proceedings of the DNA Based Computers, 1999

1998

Learning Local Languages and Their Application to DNA Sequence Analysis.

IEEE Trans. Pattern Anal. Mach. Intell., 1998

On the Universality of Post and Splicing Systems.

Proceedings of the International Colloquium Universal Machines and Computations, 1998

Locality, Reversibility, and Beyond: Learning Languages from Positive Data.

Proceedings of the Algorithmic Learning Theory, 9th International Conference, 1998

1997

Learning Approximately Regular Languages with Reversible Languages.

Theor. Comput. Sci., 1997

DNA-EC: A model of DNA-computing based on equality checking.

Proceedings of the DNA Based Computers, 1997

Identifiability of Subspaces and Homomorphic Images of Zero-Reversible Languages.

Proceedings of the Algorithmic Learning Theory, 8th International Conference, 1997

1996

Families of Noncounting Languages and Their Learnability from Positive Data.

Int. J. Found. Comput. Sci., 1996

1995

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

Machine Learning, 1995

Foreword.

IEICE Transactions, 1995

On Approximately Identifying Concept Classes in the Limit.

Proceedings of the Algorithmic Learning Theory, 6th International Conference, 1995

1994

Learning non-deterministic finite automata from queries and counterexamples.

Machine Intelligence 13, 1994

Learning Local Languages and its Application to Protein \alpha-Chain Identification.

Proceedings of the 27th Annual Hawaii International Conference on System Sciences (HICSS-27), 1994

Inductive Inference of Monogenic Pure Context-free Languages.

Proceedings of the Algorithmic Learning Theory, 1994

Learning Concatenations of Locally Testable Languages from Positive Data.

Proceedings of the Algorithmic Learning Theory, 1994

1993

Learning Two-Tape Automata from Queries and Counterexamples.

Proceedings of the Sixth Annual ACM Conference on Computational Learning Theory, 1993

1992

On Learning Systolic Languages.

Proceedings of the Algorithmic Learning Theory, Third Workshop, 1992

1991

Polynomial-Time Learning of Very Simple Grammars from Positive Data.

Proceedings of the Fourth Annual Workshop on Computational Learning Theory, 1991

1989

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

Proceedings of the Analogical and Inductive Inference, 1989

1987

On Purely Morphic Characterizations of Context-Free Languages.

Theor. Comput. Sci., 1987

Set Abstraction - An Extension of All Solutions Predicate in Logic Programming Language.

New Generation Comput., 1987

Inductive Inference of Context-free Languages - Context-free Expression Method.

Proceedings of the 10th International Joint Conference on Artificial Intelligence. Milan, 1987

1986

Logic Program Forms.

New Generation Comput., 1986

On Analogical Query Processing in Logic Database.

Proceedings of the VLDB'86 Twelfth International Conference on Very Large Data Bases, 1986

1985

AND-OR Queuing in Extended Concurrent Prolog.

Proceedings of the Logic Programming '85, 1985

A Logic Program Schema and Its Applications.

Proceedings of the 9th International Joint Conference on Artificial Intelligence. Los Angeles, 1985

1984

An Inverse Homomorphic Characterization of Full Principal AFL.

Inf. Sci., 1984

A Note on the Set Abstraction in Logic Programming Language.

FGCS, 1984

1983

Semi-Linearity, Parikh-Boundedness and Tree-Adjunct Languages.

Inf. Process. Lett., 1983

1982

A Three-Restricted Normal Form Theorem for ET0L Languages.

Inf. Process. Lett., 1982

1980

Stochastic Characterizations of EOL Languages

Information and Control, April, 1980