Takashi Yokomori

Theor. Comput. Sci., 2022

Chemical Reaction Regular Grammars.

[BibT_eX]

[DOI]

Kaoru Fujioka

New Gener. Comput., 2022

ℒ-reduction computation revisited.

[BibT_eX]

[DOI]

Kaoru Fujioka

Acta Informatica, 2022

2021

On the computing powers of L-reductions of insertion languages.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2021

Theory of reaction automata: a survey.

[BibT_eX]

[DOI]

J. Membr. Comput., 2021

2019

Decomposition and factorization of chemical reaction transducers.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2019

2018

Natural Computing Paradigm • A Concise Introduction.

[BibT_eX]

[DOI]

J. Robotics Netw. Artif. Life, 2018

Computing with Multisets: A Survey on Reaction Automata Theory.

[BibT_eX]

[DOI]

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

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

[BibT_eX]

[DOI]

Proceedings of the Reversibility and Universality, 2018

2017

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

[BibT_eX]

[DOI]

Fundam. Informaticae, 2017

2016

The computational capability of chemical reaction automata.

[BibT_eX]

[DOI]

Nat. Comput., 2016

2015

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

[BibT_eX]

[DOI]

Fundam. Informaticae, 2015

2012

Molecular Computing Machineries - Computing Models and Wet Implementations.

[BibT_eX]

[DOI]

Proceedings of the Handbook of Natural Computing, 2012

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

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2012

Reaction automata.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2012

2011

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

[BibT_eX]

[DOI]

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

On the Hairpin Incompletion.

[BibT_eX]

[DOI]

Fundam. Informaticae, 2011

Spiking Neural dP Systems.

[BibT_eX]

[DOI]

Fundam. Informaticae, 2011

2010

On spiking neural P systems.

[BibT_eX]

[DOI]

Oscar H. Ibarra

Nat. Comput., 2010

Some Remarks on the Hairpin Completion.

[BibT_eX]

[DOI]

Florin Manea

Victor Mitrana

Int. J. Found. Comput. Sci., 2010

2009

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

[BibT_eX]

[DOI]

Florin Manea

Victor Mitrana

Theor. Comput. Sci., 2009

Membrane Computing Schema: A New Approach to Computation Using String Insertions.

[BibT_eX]

[DOI]

Proceedings of the Algorithmic Bioprocesses, 2009

2008

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

[BibT_eX]

[DOI]

Kaoru Onodera

Nat. Comput., 2008

Foreword.

[BibT_eX]

[DOI]

Chengde Mao

Nat. Comput., 2008

Preface.

[BibT_eX]

[DOI]

Nat. Comput., 2008

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

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 2008

2007

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

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2007

Spiking Neural P Systems with an Exhaustive Use of Rules.

[BibT_eX]

[DOI]

Int. J. Unconv. Comput., 2007

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

[BibT_eX]

[DOI]

Proceedings of the Formal Models, 2007

2006

Spiking Neural P Systems.

[BibT_eX]

[DOI]

Fundam. Informaticae, 2006

2005

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

[BibT_eX]

[DOI]

Kaoru Onodera

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

2004

On the power of membrane division in P systems.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2004

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

[BibT_eX]

[DOI]

Leonor Becerra-Bonache

Proceedings of the Grammatical Inference: Algorithms and Applications, 2004

An Algorithm for Testing Structure Freeness of Biomolecular Sequences.

[BibT_eX]

[DOI]

Yasubumi Sakakibara

Proceedings of the Aspects of Molecular Computing, 2004

2003

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

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2003

On the computational power of insertion-deletion systems.

[BibT_eX]

[DOI]

Akihiro Takahara

Nat. Comput., 2003

2002

Corrigendum Learning Two-Type Automata from Queries and Counterexamples.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2002

A Magic Pot : Self-assembly Computation Revisited.

[BibT_eX]

[DOI]

Yasubumi Sakakibara

Proceedings of the Formal and Natural Computing, 2002

2001

Toward Soft Hardware.

[BibT_eX]

[DOI]

Soft Comput., 2001

Hairpin Languages.

[BibT_eX]

[DOI]

Grzegorz Rozenberg

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

Approximate identification of finite elasticity.

[BibT_eX]

Yasubumi Sakakibara

Proceedings of the Where Mathematics, 2001

2000

On the universality of Post and splicing systems.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2000

Simulating H Systems by P Systems.

[BibT_eX]

[DOI]

J. Univers. Comput. Sci., 2000

1999

Tree Adjoining Grammars for RNA Structure Prediction.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1999

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

[BibT_eX]

[DOI]

Proceedings of the Developments in Language Theory, 1999

YAC: Yet another computation model of self-assembly.

[BibT_eX]

[DOI]

Proceedings of the DNA Based Computers, 1999

Membrane computing based on splicing.

[BibT_eX]

[DOI]

Proceedings of the DNA Based Computers, 1999

1998

Learning Local Languages and Their Application to DNA Sequence Analysis.

[BibT_eX]

[DOI]

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

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

[BibT_eX]

[DOI]

Tom Head

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

1997

Learning Approximately Regular Languages with Reversible Languages.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1997

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

[BibT_eX]

[DOI]

Proceedings of the DNA Based Computers, 1997

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

[BibT_eX]

[DOI]

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

1996

Learning Two-Tape Automata from Queries and Counterexamples.

[BibT_eX]

[DOI]

Math. Syst. Theory, 1996

Families of Noncounting Languages and Their Learnability from Positive Data.

[BibT_eX]

[DOI]

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

1995

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

[BibT_eX]

[DOI]

Mach. Learn., 1995

Foreword.

[BibT_eX]

[DOI]

IEICE Trans. Inf. Syst., 1995

On Approximately Identifying Concept Classes in the Limit.

[BibT_eX]

[DOI]

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

1994

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

[BibT_eX]

Nobuyuki Ishida

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

Inductive Inference of Monogenic Pure Context-free Languages.

[BibT_eX]

[DOI]

Noriyuki Tanida

Proceedings of the Algorithmic Learning Theory, 1994

Learning Concatenations of Locally Testable Languages from Positive Data.

[BibT_eX]

[DOI]

Proceedings of the Algorithmic Learning Theory, 1994

1993

Learning local and recognizable Ω-languages and monadic logic programs.

[BibT_eX]

Ahmed Saoudi

Proceedings of the First European Conference on Computational Learning Theory, 1993

1992

Learning non-deterministic finite automata from queries and counterexamples.

[BibT_eX]

Proceedings of the Machine Intelligence 13, 1992

On Learning Systolic Languages.

[BibT_eX]

[DOI]

Proceedings of the Algorithmic Learning Theory, Third Workshop, 1992

1991

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

[BibT_eX]

[DOI]

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

Polynomial-time identification of very regular languages in the limit.

[BibT_eX]

Noriyuki Tanida

Proceedings of the Algorithmic Learning Theory, 2nd International Workshop, 1991

1989

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

[BibT_eX]

[DOI]

Proceedings of the Analogical and Inductive Inference, 1989

1987

On Purely Morphic Characterizations of Context-Free Languages.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1987

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

[BibT_eX]

[DOI]

New Gener. Comput., 1987

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

[BibT_eX]

[DOI]

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

1986

Logic Program Forms.

[BibT_eX]

[DOI]

New Gener. Comput., 1986

On Analogical Query Processing in Logic Database.

[BibT_eX]

[DOI]

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

1985

AND-OR Queuing in Extended Concurrent Prolog.

[BibT_eX]

[DOI]

Jiro Tanaka

Makoto Kishishita

Proceedings of the Logic Programming '85, 1985

A Logic Program Schema and Its Applications.

[BibT_eX]

[DOI]

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

1984

An Inverse Homomorphic Characterization of Full Principal AFL.

[BibT_eX]

[DOI]

Derick Wood

Inf. Sci., 1984

A Note on the Set Abstraction in Logic Programming Language.

[BibT_eX]

Proceedings of the International Conference on Fifth Generation Computer Systems, 1984

1983

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

[BibT_eX]

[DOI]

Aravind K. Joshi

Inf. Process. Lett., 1983

1982

A Three-Restricted Normal Form Theorem for ET0L Languages.

[BibT_eX]

[DOI]

Derick Wood

Klaus-Jörn Lange

Inf. Process. Lett., 1982

1980

Stochastic Characterizations of EOL Languages

[BibT_eX]

[DOI]