Stochastic Characterizations of EOL Languages - Takashi Yokomori (Inf. Control., 1980)

A Three-Restricted Normal Form Theorem for ET0L Languages. - Takashi Yokomori; Derick Wood; Klaus-Jörn Lange (Inf. Process. Lett., 1982)

Semi-Linearity, Parikh-Boundedness and Tree-Adjunct Languages. - Takashi Yokomori; Aravind K. Joshi (Inf. Process. Lett., 1983)

A Note on the Set Abstraction in Logic Programming Language. - Takashi Yokomori (FGCS, 1984)

An Inverse Homomorphic Characterization of Full Principal AFL. - Takashi Yokomori; Derick Wood (Inf. Sci., 1984)

A Logic Program Schema and Its Applications. - Takashi Yokomori (IJCAI, 1985)

AND-OR Queuing in Extended Concurrent Prolog. - Jiro Tanaka; Takashi Yokomori; Makoto Kishishita (LP, 1985)

On Analogical Query Processing in Logic Database. - Takashi Yokomori (VLDB, 1986)

Logic Program Forms. - Takashi Yokomori (New Gener. Comput., 1986)

Inductive Inference of Context-free Languages - Context-free Expression Method. - Takashi Yokomori (IJCAI, 1987)

Set Abstraction - An Extension of All Solutions Predicate in Logic Programming Language. - Takashi Yokomori (New Gener. Comput., 1987)

On Purely Morphic Characterizations of Context-Free Languages. - Takashi Yokomori (Theor. Comput. Sci., 1987)

Learning Context-Free Languages Efficiently - A Report on Recent Results in Japan. - Takashi Yokomori (AII, 1989)

Polynomial-time identification of very regular languages in the limit. - Noriyuki Tanida; Takashi Yokomori (ALT, 1991)

Polynomial-Time Learning of Very Simple Grammars from Positive Data. - Takashi Yokomori (COLT, 1991)

On Learning Systolic Languages. - Takashi Yokomori (ALT, 1992)

Learning non-deterministic finite automata from queries and counterexamples. - Takashi Yokomori (Machine Intelligence 13, 1992)

Learning local and recognizable Ω-languages and monadic logic programs. - Ahmed Saoudi; Takashi Yokomori (EuroCOLT, 1993)

Learning Concatenations of Locally Testable Languages from Positive Data. - Satoshi Kobayashi; Takashi Yokomori (AII/ALT, 1994)

Inductive Inference of Monogenic Pure Context-free Languages. - Noriyuki Tanida; Takashi Yokomori (AII/ALT, 1994)

Learning Local Languages and its Application to Protein alpha-Chain Identification. - Takashi Yokomori; Nobuyuki Ishida; Satoshi Kobayashi (HICSS (5), 1994)

On Approximately Identifying Concept Classes in the Limit. - Satoshi Kobayashi; Takashi Yokomori (ALT, 1995)

Foreword. - Takashi Yokomori (IEICE Trans. Inf. Syst., 1995)

On Polynomial-Time Learnability in the Limit of Strictly Deterministic Automata. - Takashi Yokomori (Mach. Learn., 1995)

Families of Noncounting Languages and Their Learnability from Positive Data. - Satoshi Kobayashi; Takashi Yokomori (Int. J. Found. Comput. Sci., 1996)

Learning Two-Tape Automata from Queries and Counterexamples. - Takashi Yokomori (Math. Syst. Theory, 1996)

Identifiability of Subspaces and Homomorphic Images of Zero-Reversible Languages. - Satoshi Kobayashi; Takashi Yokomori (ALT, 1997)

DNA-EC: A model of DNA-computing based on equality checking. - Takashi Yokomori; Satoshi Kobayashi (DNA Based Computers, 1997)

DNA implementation of simple Horn clause computation. - Satoshi Kobayashi; Takashi Yokomori; G. Sampei; K. Mizobuchi (ICEC, 1997)

On the power of circular splicing systems and DNA computability. - Takashi Yokomori; Satoshi Kobayashi; Claudio Ferretti (ICEC, 1997)

Learning Approximately Regular Languages with Reversible Languages. - Satoshi Kobayashi; Takashi Yokomori (Theor. Comput. Sci., 1997)

Locality, Reversibility, and Beyond: Learning Languages from Positive Data. - Tom Head; Satoshi Kobayashi; Takashi Yokomori (ALT, 1998)

Learning Local Languages and Their Application to DNA Sequence Analysis. - Takashi Yokomori; Satoshi Kobayashi (IEEE Trans. Pattern Anal. Mach. Intell., 1998)

Membrane computing based on splicing. - Gheorghe Paun; Takashi Yokomori (DNA Based Computers, 1999)

YAC: Yet another computation model of self-assembly. - Takashi Yokomori (DNA Based Computers, 1999)

Computation = self-assembly + conformational change: toward new computing paradigms. - Takashi Yokomori (Developments in Language Theory, 1999)

Tree Adjoining Grammars for RNA Structure Prediction. - Yasuo Uemura; Aki Hasegawa; Satoshi Kobayashi; Takashi Yokomori (Theor. Comput. Sci., 1999)

Simulating H Systems by P Systems. - Gheorghe Paun; Takashi Yokomori (J. Univers. Comput. Sci., 2000)

On the universality of Post and splicing systems. - Claudio Ferretti; Giancarlo Mauri; Satoshi Kobayashi; Takashi Yokomori (Theor. Comput. Sci., 2000)

Approximate identification of finite elasticity. - Satoshi Kobayashi; Yasubumi Sakakibara; Takashi Yokomori (Where Mathematics, Computer Science, Linguistics and Biology Meet, 2001)

Hairpin Languages. - Gheorghe Paun; Grzegorz Rozenberg; Takashi Yokomori (Int. J. Found. Comput. Sci., 2001)

Toward Soft Hardware. - Gheorghe Paun; Takashi Yokomori (Soft Comput., 2001)

A Magic Pot : Self-assembly Computation Revisited. - Takashi Yokomori; Yasubumi Sakakibara; Satoshi Kobayashi (Formal and Natural Computing, 2002)

Corrigendum Learning Two-Type Automata from Queries and Counterexamples. - Takashi Yokomori (Theory Comput. Syst., 2002)

On the computational power of insertion-deletion systems. - Akihiro Takahara; Takashi Yokomori (Nat. Comput., 2003)

Polynomial-time identification of very simple grammars from positive data. - Takashi Yokomori (Theor. Comput. Sci., 2003)

An Algorithm for Testing Structure Freeness of Biomolecular Sequences. - Satoshi Kobayashi; Takashi Yokomori; Yasubumi Sakakibara (Aspects of Molecular Computing, 2004)

Learning Mild Context-Sensitiveness: Toward Understanding Children's Language Learning. - Leonor Becerra-Bonache; Takashi Yokomori (ICGI, 2004)

On the power of membrane division in P systems. - Gheorghe Paun; Yasuhiro Suzuki; Hiroshi Tanaka; Takashi Yokomori (Theor. Comput. Sci., 2004)

Linearizer and Doubler : Two Mappings to Unify Molecular Computing Models Based on DNA Complementarity. - Kaoru Onodera; Takashi Yokomori (DNA, 2005)

Spiking Neural P Systems. - Mihai Ionescu; Gheorghe Paun; Takashi Yokomori (Fundam. Informaticae, 2006)

Probabilistic Inference in Test Tube and its Application to Gene Expression Profiles. - Yasubumi Sakakibara; Takashi Yokomori; Satoshi Kobayashi; Akira Suyama (Formal Models, Languages and Applications, 2007)

Spiking Neural P Systems with an Exhaustive Use of Rules. - Gheorghe Paun; Mihai Ionescu; Takashi Yokomori (Int. J. Unconv. Comput., 2007)

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

Representations and Characterizations of Languages in Chomsky Hierarchy by Means of Insertion-Deletion Systems. - Gheorghe Paun; Mario J. Pérez-Jiménez; Takashi Yokomori (Int. J. Found. Comput. Sci., 2008)

Preface. - Mihai Ionescu; Gheorghe Paun; Takashi Yokomori (Nat. Comput., 2008)

Foreword. - Chengde Mao; Takashi Yokomori (Nat. Comput., 2008)

Doubler and linearizer: an approach toward a unified theory for molecular computing based on DNA complementarity. - Kaoru Onodera; Takashi Yokomori (Nat. Comput., 2008)

Membrane Computing Schema: A New Approach to Computation Using String Insertions. - Mario J. Pérez-Jiménez; Takashi Yokomori (Algorithmic Bioprocesses, 2009)

Two complementary operations inspired by the DNA hairpin formation: Completion and reduction. - Florin Manea; Victor Mitrana; Takashi Yokomori (Theor. Comput. Sci., 2009)

Some Remarks on the Hairpin Completion. - Florin Manea; Victor Mitrana; Takashi Yokomori (Int. J. Found. Comput. Sci., 2010)

On spiking neural P systems. - Oscar H. Ibarra; Mario J. Pérez-Jiménez; Takashi Yokomori (Nat. Comput., 2010)

Spiking Neural dP Systems. - Mihai Ionescu; Gheorghe Paun; Mario J. Pérez-Jiménez; Takashi Yokomori (Fundam. Informaticae, 2011)

On the Hairpin Incompletion. - Fumiya Okubo; Takashi Yokomori (Fundam. Informaticae, 2011)

Morphic Characterizations of Language Families in Terms of Insertion Systems and Star Languages. - Fumiya Okubo; Takashi Yokomori (Int. J. Found. Comput. Sci., 2011)

Reaction automata. - Fumiya Okubo; Satoshi Kobayashi; Takashi Yokomori (Theor. Comput. Sci., 2012)

On the properties of language classes defined by bounded reaction automata. - Fumiya Okubo; Satoshi Kobayashi; Takashi Yokomori (Theor. Comput. Sci., 2012)

Molecular Computing Machineries - Computing Models and Wet Implementations. - Masami Hagiya; Satoshi Kobayashi; Ken Komiya; Fumiaki Tanaka; Takashi Yokomori (Handbook of Natural Computing, 2012)

Finite Automata with Multiset Memory: A New Characterization of Chomsky Hierarchy. - Fumiya Okubo; Takashi Yokomori (Fundam. Informaticae, 2015)

The computational capability of chemical reaction automata. - Fumiya Okubo; Takashi Yokomori (Nat. Comput., 2016)

Morphic Characterizations of Language Families Based on Local and Star Languages. - Fumiya Okubo; Takashi Yokomori (Fundam. Informaticae, 2017)

The Computing Power of Determinism and Reversibility in Chemical Reaction Automata. - Fumiya Okubo; Takashi Yokomori (Reversibility and Universality, 2018)

Computing with Multisets: A Survey on Reaction Automata Theory. - Takashi Yokomori; Fumiya Okubo (CiE, 2018)

Natural Computing Paradigm • A Concise Introduction. - Takashi Yokomori (J. Robotics Netw. Artif. Life, 2018)

Decomposition and factorization of chemical reaction transducers. - Fumiya Okubo; Takashi Yokomori (Theor. Comput. Sci., 2019)

Theory of reaction automata: a survey. - Takashi Yokomori; Fumiya Okubo (J. Membr. Comput., 2021)

On the computing powers of L-reductions of insertion languages. - Fumiya Okubo; Takashi Yokomori (Theor. Comput. Sci., 2021)

ℒ-reduction computation revisited. - Kaoru Fujioka; Fumiya Okubo; Takashi Yokomori (Acta Informatica, 2022)

Chemical Reaction Regular Grammars. - Fumiya Okubo; Kaoru Fujioka; Takashi Yokomori (New Gener. Comput., 2022)

Corrigendum to "On the computing powers of L-reductions of insertion languages" [Theor. Comput. Sci. 862 (2021) 224-235]. - Fumiya Okubo; Takashi Yokomori (Theor. Comput. Sci., 2022)