Takashi Yokomori

Publication Activity (10 Years)

Years Active: 1980-2022
Publications (10 Years): 10

Top Topics

Computing Paradigms

Finite Automata

Linguistic Resources

Chemical Reaction

Top Venues

Theor. Comput. Sci.

Fundam. Informaticae

Acta Informatica

Publications

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