Takashi Yokomori

93 papers A* 5B 12C 4Journal 50Unranked 20
YearRankTypeTitle / Venue / Authors
2022 J jnl
Chemical Reaction Regular Grammars.
New Gener. Comput.
Fumiya Okubo, Kaoru Fujioka, Takashi Yokomori
2022 J jnl
Corrigendum to "On the computing powers of L-reductions of insertion languages" [Theor. Comput. Sci. 862 (2021) 224-235].
Theor. Comput. Sci.
Fumiya Okubo, Takashi Yokomori
2022 J jnl
ℒ-reduction computation revisited.
Acta Informatica
Kaoru Fujioka, Fumiya Okubo, Takashi Yokomori
2021 J jnl
On the computing powers of L-reductions of insertion languages.
Theor. Comput. Sci.
Fumiya Okubo, Takashi Yokomori
2021 J jnl
Theory of reaction automata: a survey.
J. Membr. Comput.
Takashi Yokomori, Fumiya Okubo
2019 J jnl
Decomposition and factorization of chemical reaction transducers.
Theor. Comput. Sci.
Fumiya Okubo, Takashi Yokomori
2018 C conf
Computing with Multisets: A Survey on Reaction Automata Theory.
CiE
Takashi Yokomori, Fumiya Okubo
2018 J jnl
Natural Computing Paradigm • A Concise Introduction.
J. Robotics Netw. Artif. Life
Takashi Yokomori
2018 — ch.
The Computing Power of Determinism and Reversibility in Chemical Reaction Automata.
Reversibility and Universality
Fumiya Okubo, Takashi Yokomori
2017 J jnl
Morphic Characterizations of Language Families Based on Local and Star Languages.
Fundam. Informaticae
Fumiya Okubo, Takashi Yokomori
2016 J jnl
The computational capability of chemical reaction automata.
Nat. Comput.
Fumiya Okubo, Takashi Yokomori
2015 J jnl
Finite Automata with Multiset Memory: A New Characterization of Chomsky Hierarchy.
Fundam. Informaticae
Fumiya Okubo, Takashi Yokomori
2014 B conf
The Computational Capability of Chemical Reaction Automata.
DNA
Fumiya Okubo, Takashi Yokomori
2012 — ch.
Molecular Computing Machineries - Computing Models and Wet Implementations.
Handbook of Natural Computing
Masami Hagiya, Satoshi Kobayashi, Ken Komiya, Fumiaki Tanaka, Takashi Yokomori
2012 J jnl
On the Properties of Language Classes Defined by Bounded Reaction Automata
CoRR
Fumiya Okubo, Satoshi Kobayashi, Takashi Yokomori
2012 J jnl
On the properties of language classes defined by bounded reaction automata.
Theor. Comput. Sci.
Fumiya Okubo, Satoshi Kobayashi, Takashi Yokomori
2012 J jnl
Reaction automata.
Theor. Comput. Sci.
Fumiya Okubo, Satoshi Kobayashi, Takashi Yokomori
2011 J jnl
Morphic Characterizations of Language Families in Terms of Insertion Systems and Star Languages.
Int. J. Found. Comput. Sci.
Fumiya Okubo, Takashi Yokomori
2011 J jnl
On the Hairpin Incompletion
CoRR
Fumiya Okubo, Takashi Yokomori
2011 J jnl
On the Hairpin Incompletion.
Fundam. Informaticae
Fumiya Okubo, Takashi Yokomori
2011 J jnl
Reaction Automata
CoRR
Fumiya Okubo, Satoshi Kobayashi, Takashi Yokomori
2011 J jnl
Spiking Neural dP Systems.
Fundam. Informaticae
Mihai Ionescu, Gheorghe Paun, Mario J. Pérez-Jiménez, Takashi Yokomori
2010 J jnl
On spiking neural P systems.
Nat. Comput.
Oscar H. Ibarra, Mario J. Pérez-Jiménez, Takashi Yokomori
2010 J jnl
Some Remarks on the Hairpin Completion.
Int. J. Found. Comput. Sci.
Florin Manea, Victor Mitrana, Takashi Yokomori
2009 — conf
Membrane Computing Schema: A New Approach to Computation Using String Insertions.
Algorithmic Bioprocesses
Mario J. Pérez-Jiménez, Takashi Yokomori
2009 J jnl
Two complementary operations inspired by the DNA hairpin formation: Completion and reduction.
Theor. Comput. Sci.
Florin Manea, Victor Mitrana, Takashi Yokomori
2008 J jnl
Doubler and linearizer: an approach toward a unified theory for molecular computing based on DNA complementarity.
Nat. Comput.
Kaoru Onodera, Takashi Yokomori
2008 J jnl
Foreword.
Nat. Comput.
Chengde Mao, Takashi Yokomori
2008 J jnl
Preface.
Nat. Comput.
Mihai Ionescu, Gheorghe Paun, Takashi Yokomori
2008 J jnl
Representations and Characterizations of Languages in Chomsky Hierarchy by Means of Insertion-Deletion Systems.
Int. J. Found. Comput. Sci.
Gheorghe Paun, Mario J. Pérez-Jiménez, Takashi Yokomori
2008 — conf
Some Remarks on the Hairpin Completion.
AFL
Florin Manea, Victor Mitrana, Takashi Yokomori
2007 J jnl
Erratum to "Polynomial-time identification of very simple grammars from positive data" [Theoret. Comput. Science 298 (2003) 179-206].
Theor. Comput. Sci.
Takashi Yokomori
2007 — conf
Probabilistic Inference in Test Tube and its Application to Gene Expression Profiles.
Formal Models, Languages and Applications
Yasubumi Sakakibara, Takashi Yokomori, Satoshi Kobayashi, Akira Suyama
2007 — conf
Representations and Characterizations of Languages in Chomsky Hierarchy by Means of Insertion-Deletion Systems.
DCFS
Gheorghe Paun, Mario J. Pérez-Jiménez, Takashi Yokomori
2007 J jnl
Spiking Neural P Systems with an Exhaustive Use of Rules.
Int. J. Unconv. Comput.
Gheorghe Paun, Mihai Ionescu, Takashi Yokomori
2006 B ed.
DNA Computing, 12th International Meeting on DNA Computing, DNA 2006, Seoul, South Korea, June 5-9, 2006, Revised Selected Papers
DNA
Chengde Mao, Takashi Yokomori
2006 J jnl
Spiking Neural P Systems.
Fundam. Informaticae
Mihai Ionescu, Gheorghe Paun, Takashi Yokomori
2005 B conf
Linearizer and Doubler : Two Mappings to Unify Molecular Computing Models Based on DNA Complementarity.
DNA
Kaoru Onodera, Takashi Yokomori
2004 — conf
An Algorithm for Testing Structure Freeness of Biomolecular Sequences.
Aspects of Molecular Computing
Satoshi Kobayashi, Takashi Yokomori, Yasubumi Sakakibara
2004 — conf
Learning Mild Context-Sensitiveness: Toward Understanding Children's Language Learning.
ICGI
Leonor Becerra-Bonache, Takashi Yokomori
2004 J jnl
On the power of membrane division in P systems.
Theor. Comput. Sci.
Gheorghe Paun, Yasuhiro Suzuki, Hiroshi Tanaka, Takashi Yokomori
2003 J jnl
On the computational power of insertion-deletion systems.
Nat. Comput.
Akihiro Takahara, Takashi Yokomori
2003 J jnl
Polynomial-time identification of very simple grammars from positive data.
Theor. Comput. Sci.
Takashi Yokomori
2002 — conf
A Magic Pot : Self-assembly Computation Revisited.
Formal and Natural Computing
Takashi Yokomori, Yasubumi Sakakibara, Satoshi Kobayashi
2002 J jnl
Corrigendum Learning Two-Type Automata from Queries and Counterexamples.
Theory Comput. Syst.
Takashi Yokomori
2002 B conf
On the Computational Power of Insertion-Deletion Systems.
DNA
Akihiro Takahara, Takashi Yokomori
2001 — conf
Approximate identification of finite elasticity.
Where Mathematics, Computer Science, Linguistics and Biology Meet
Satoshi Kobayashi, Yasubumi Sakakibara, Takashi Yokomori
2001 J jnl
Hairpin Languages.
Int. J. Found. Comput. Sci.
Gheorghe Paun, Grzegorz Rozenberg, Takashi Yokomori
2001 J jnl
Toward Soft Hardware.
Soft Comput.
Gheorghe Paun, Takashi Yokomori
2000 J jnl
On the universality of Post and splicing systems.
Theor. Comput. Sci.
Claudio Ferretti, Giancarlo Mauri, Satoshi Kobayashi, Takashi Yokomori
2000 J jnl
Simulating H Systems by P Systems.
J. Univers. Comput. Sci.
Gheorghe Paun, Takashi Yokomori
1999 B ed.
Algorithmic Learning Theory, 10th International Conference, ALT '99, Tokyo, Japan, December 6-8, 1999, Proceedings
ALT
Osamu Watanabe, Takashi Yokomori
1999 C conf
Computation = self-assembly + conformational change: toward new computing paradigms.
Developments in Language Theory
Takashi Yokomori
1999 — conf
Membrane computing based on splicing.
DNA Based Computers
Gheorghe Paun, Takashi Yokomori
1999 J jnl
Tree Adjoining Grammars for RNA Structure Prediction.
Theor. Comput. Sci.
Yasuo Uemura, Aki Hasegawa, Satoshi Kobayashi, Takashi Yokomori
1999 — conf
YAC: Yet another computation model of self-assembly.
DNA Based Computers
Takashi Yokomori
1998 J jnl
Learning Local Languages and Their Application to DNA Sequence Analysis.
IEEE Trans. Pattern Anal. Mach. Intell.
Takashi Yokomori, Satoshi Kobayashi
1998 B conf
Locality, Reversibility, and Beyond: Learning Languages from Positive Data.
ALT
Tom Head, Satoshi Kobayashi, Takashi Yokomori
1998 — conf
On the Universality of Post and Splicing Systems.
MCU (2)
Claudio Ferretti, Giancarlo Mauri, Satoshi Kobayashi, Takashi Yokomori
1997 C conf
DNA implementation of simple Horn clause computation.
ICEC
Satoshi Kobayashi, Takashi Yokomori, G. Sampei, K. Mizobuchi
1997 — conf
DNA-EC: A model of DNA-computing based on equality checking.
DNA Based Computers
Takashi Yokomori, Satoshi Kobayashi
1997 B conf
Identifiability of Subspaces and Homomorphic Images of Zero-Reversible Languages.
ALT
Satoshi Kobayashi, Takashi Yokomori
1997 J jnl
Learning Approximately Regular Languages with Reversible Languages.
Theor. Comput. Sci.
Satoshi Kobayashi, Takashi Yokomori
1997 C conf
On the power of circular splicing systems and DNA computability.
ICEC
Takashi Yokomori, Satoshi Kobayashi, Claudio Ferretti
1996 J jnl
Families of Noncounting Languages and Their Learnability from Positive Data.
Int. J. Found. Comput. Sci.
Satoshi Kobayashi, Takashi Yokomori
1996 J jnl
Learning Two-Tape Automata from Queries and Counterexamples.
Math. Syst. Theory
Takashi Yokomori
1995 J jnl
Foreword.
IEICE Trans. Inf. Syst.
Takashi Yokomori
1995 B conf
On Approximately Identifying Concept Classes in the Limit.
ALT
Satoshi Kobayashi, Takashi Yokomori
1995 J jnl
On Polynomial-Time Learnability in the Limit of Strictly Deterministic Automata.
Mach. Learn.
Takashi Yokomori
1994 — conf
Inductive Inference of Monogenic Pure Context-free Languages.
AII/ALT
Noriyuki Tanida, Takashi Yokomori
1994 — conf
Learning Concatenations of Locally Testable Languages from Positive Data.
AII/ALT
Satoshi Kobayashi, Takashi Yokomori
1994 — conf
Learning Local Languages and its Application to Protein \alpha-Chain Identification.
HICSS (5)
Takashi Yokomori, Nobuyuki Ishida, Satoshi Kobayashi
1993 B ed.
Algorithmic Learning Theory, 4th International Workshop, ALT '93, Tokyo, Japan, November 8-10, 1993, Proceedings
ALT
Klaus P. Jantke, Shigenobu Kobayashi, Etsuji Tomita, Takashi Yokomori
1993 A* conf
Learning Two-Tape Automata from Queries and Counterexamples.
COLT
Takashi Yokomori
1993 — conf
Learning local and recognizable Ω-languages and monadic logic programs.
EuroCOLT
Ahmed Saoudi, Takashi Yokomori
1992 — conf
Learning non-deterministic finite automata from queries and counterexamples.
Machine Intelligence 13
Takashi Yokomori
1992 B conf
On Learning Systolic Languages.
ALT
Takashi Yokomori
1991 A* conf
Polynomial-Time Learning of Very Simple Grammars from Positive Data.
COLT
Takashi Yokomori
1991 B conf
Polynomial-time identification of very regular languages in the limit.
ALT
Noriyuki Tanida, Takashi Yokomori
1990 B ed.
Algorithmic Learning Theory, First International Workshop, ALT '90, Tokyo, Japan, October 8-10, 1990, Proceedings
ALT
Setsuo Arikawa, Shigeki Goto, Setsuo Ohsuga, Takashi Yokomori
1989 — conf
Learning Context-Free Languages Efficiently - A Report on Recent Results in Japan.
AII
Takashi Yokomori
1987 A* conf
Inductive Inference of Context-free Languages - Context-free Expression Method.
IJCAI
Takashi Yokomori
1987 J jnl
On Purely Morphic Characterizations of Context-Free Languages.
Theor. Comput. Sci.
Takashi Yokomori
1987 J jnl
Set Abstraction - An Extension of All Solutions Predicate in Logic Programming Language.
New Gener. Comput.
Takashi Yokomori
1986 J jnl
Logic Program Forms.
New Gener. Comput.
Takashi Yokomori
1986 A* conf
On Analogical Query Processing in Logic Database.
VLDB
Takashi Yokomori
1985 A* conf
A Logic Program Schema and Its Applications.
IJCAI
Takashi Yokomori
1985 — conf
AND-OR Queuing in Extended Concurrent Prolog.
LP
Jiro Tanaka, Takashi Yokomori, Makoto Kishishita
1984 — conf
A Note on the Set Abstraction in Logic Programming Language.
FGCS
Takashi Yokomori
1984 J jnl
An Inverse Homomorphic Characterization of Full Principal AFL.
Inf. Sci.
Takashi Yokomori, Derick Wood
1983 J jnl
Semi-Linearity, Parikh-Boundedness and Tree-Adjunct Languages.
Inf. Process. Lett.
Takashi Yokomori, Aravind K. Joshi
1982 J jnl
A Three-Restricted Normal Form Theorem for ET0L Languages.
Inf. Process. Lett.
Takashi Yokomori, Derick Wood, Klaus-Jörn Lange
1980 J jnl
Stochastic Characterizations of EOL Languages
Inf. Control.
Takashi Yokomori