Takashi Yokomori

Fumiya Okubo, Satoshi Kobayashi, Takashi Yokomori: Reaction automata. Theor. Comput. Sci. 429: 247-257 (2012)

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

Fumiya Okubo, Satoshi Kobayashi, Takashi Yokomori: On the Properties of Language Classes Defined by Bounded Reaction Automata. CoRR abs/1201.3082 (2012)

Fumiya Okubo, Takashi Yokomori: On the Hairpin Incompletion. Fundam. Inform. 110(1-4): 255-269 (2011)

Mihai Ionescu, Gheorghe Paun, Mario J. Pérez-Jiménez, Takashi Yokomori: Spiking Neural dP Systems. Fundam. Inform. 111(4): 423-436 (2011)

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

Fumiya Okubo, Takashi Yokomori: On the Hairpin Incompletion. CoRR abs/1102.3503 (2011)

Fumiya Okubo, Satoshi Kobayashi, Takashi Yokomori: Reaction Automata. CoRR abs/1111.5038 (2011)

Florin Manea, Victor Mitrana, Takashi Yokomori: Some Remarks on the Hairpin Completion. Int. J. Found. Comput. Sci. 21(5): 859-872 (2010)

Oscar H. Ibarra, Mario J. Pérez-Jiménez, Takashi Yokomori: On spiking neural P systems. Natural Computing 9(2): 475-491 (2010)

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

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): 859-871 (2008)

Kaoru Onodera, Takashi Yokomori: Doubler and linearizer: an approach toward a unified theory for molecular computing based on DNA complementarity. Natural Computing 7(1): 125-143 (2008)

Chengde Mao, Takashi Yokomori: Foreword. Natural Computing 7(2): 145-146 (2008)

Mihai Ionescu, Gheorghe Paun, Takashi Yokomori: Preface. Natural Computing 7(4): 451-452 (2008)

Florin Manea, Victor Mitrana, Takashi Yokomori: Some Remarks on the Hairpin Completion. AFL 2008: 302-313

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): 282-283 (2007)

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: 304-319

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: 129-140

Mihai Ionescu, Gheorghe Paun, Takashi Yokomori: Spiking Neural P Systems. Fundam. Inform. 71(2-3): 279-308 (2006)

Chengde Mao, Takashi Yokomori (Eds.): DNA Computing, 12th International Meeting on DNA Computing, DNA12, Seoul, Korea, June 5-9, 2006, Revised Selected Papers. Lecture Notes in Computer Science 4287, Springer 2006, isbn 3-540-49024-8

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

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

Satoshi Kobayashi, Takashi Yokomori, Yasubumi Sakakibara: An Algorithm for Testing Structure Freeness of Biomolecular Sequences. Aspects of Molecular Computing 2004: 266-277

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

Akihiro Takahara, Takashi Yokomori: On the computational power of insertion-deletion systems. Natural Computing 2(4): 321-336 (2003)

Takashi Yokomori: Polynomial-time identification of very simple grammars from positive data. Theor. Comput. Sci. 1(298): 179-206 (2003)

Takashi Yokomori: Corrigendum Learning Two-Type Automata from Queries and Counterexamples. Theory Comput. Syst. 35(4): 465-466 (2002)

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

Akihiro Takahara, Takashi Yokomori: On the Computational Power of Insertion-Deletion Systems. DNA 2002: 269-280

Gheorghe Paun, Grzegorz Rozenberg, Takashi Yokomori: Hairpin Languages. Int. J. Found. Comput. Sci. 12(6): 837-847 (2001)

Gheorghe Paun, Takashi Yokomori: Toward Soft Hardware. Soft Comput. 5(2): 93-94 (2001)

Satoshi Kobayashi, Yasubumi Sakakibara, Takashi Yokomori: Approximate identification of finite elasticity. Where Mathematics, Computer Science, Linguistics and Biology Meet 2001: 277-286

Gheorghe Paun, Takashi Yokomori: Simulating H Systems by P Systems. J. UCS 6(1): 178-193 (2000)

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

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

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

Osamu Watanabe, Takashi Yokomori (Eds.): Algorithmic Learning Theory, 10th International Conference, ALT '99, Tokyo, Japan, December 6-8, 1999, Proceedings. Lecture Notes in Computer Science 1720, Springer 1999, isbn 3-540-66748-2

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

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

Claudio Ferretti, Giancarlo Mauri, Satoshi Kobayashi, Takashi Yokomori: On the Universality of Post and Splicing Systems. MCU (2) 1998: 12-28

Satoshi Kobayashi, Takashi Yokomori: Learning Approximately Regular Languages with Reversible Languages. Theor. Comput. Sci. 174(1-2): 251-257 (1997)

Satoshi Kobayashi, Takashi Yokomori: Identifiability of Subspaces and Homomorphic Images of Zero-Reversible Languages. ALT 1997: 48-61

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

Takashi Yokomori: Learning Two-Tape Automata from Queries and Counterexamples. Mathematical Systems Theory 29(3): 259-270 (1996)

Takashi Yokomori: Foreword. IEICE Transactions 78-D(5): 517 (1995)

Takashi Yokomori: On Polynomial-Time Learnability in the Limit of Strictly Deterministic Automata. Machine Learning 19(2): 153-179 (1995)

Satoshi Kobayashi, Takashi Yokomori: On Approximately Identifying Concept Classes in the Limit. ALT 1995: 298-312

Satoshi Kobayashi, Takashi Yokomori: Learning Concatenations of Locally Testable Languages from Positive Data. AII/ALT 1994: 407-422

Noriyuki Tanida, Takashi Yokomori: Inductive Inference of Monogenic Pure Context-free Languages. AII/ALT 1994: 560-573

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

Takashi Yokomori: Learning non-deterministic finite automata from queries and counterexamples. Machine Intelligence 13 1994: 169-189

Takashi Yokomori: Learning Two-Tape Automata from Queries and Counterexamples. COLT 1993: 228-235

Klaus P. Jantke, Shigenobu Kobayashi, Etsuji Tomita, Takashi Yokomori (Eds.): Algorithmic Learning Theory, 4th International Workshop, ALT '93, Tokyo, Japan, November 8-10, 1993, Proceedings. Lecture Notes in Computer Science 744, Springer 1993, isbn 3-540-57370-4

Takashi Yokomori: On Learning Systolic Languages. ALT 1992: 41-52

Takashi Yokomori: Polynomial-Time Learning of Very Simple Grammars from Positive Data. COLT 1991: 213-227

Takashi Yokomori: Learning Context-Free Languages Efficiently - A Report on Recent Results in Japan. AII 1989: 104-123

Takashi Yokomori: Set Abstraction - An Extension of All Solutions Predicate in Logic Programming Language. New Generation Comput. 5(3): 227-248 (1987)

Takashi Yokomori: On Purely Morphic Characterizations of Context-Free Languages. Theor. Comput. Sci. 51: 301-308 (1987)

Takashi Yokomori: Inductive Inference of Context-free Languages- Context-free Expression Method. IJCAI 1987: 283-286

Takashi Yokomori: Logic Program Forms. New Generation Comput. 4(3): 305-319 (1986)

Takashi Yokomori: On Analogical Query Processing in Logic Database. VLDB 1986: 376-383

Takashi Yokomori: A Logic Program Schema and Its Applications. IJCAI 1985: 723-725

Jiro Tanaka, Takashi Yokomori, Makoto Kishishita: AND-OR Queuing in Extended Concurrent Prolog. LP 1985: 156-167

Takashi Yokomori, Derick Wood: An Inverse Homomorphic Characterization of Full Principal AFL. Inf. Sci. 33(3): 209-215 (1984)

Takashi Yokomori: A Note on the Set Abstraction in Logic Programming Language. FGCS 1984: 333-340

Takashi Yokomori, Aravind K. Joshi: Semi-Linearity, Parikh-Boundedness and Tree-Adjunct Languages. Inf. Process. Lett. 17(3): 137-143 (1983)

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

Takashi Yokomori: Stochastic Characterizations of EOL Languages. Information and Control 45(1): 26-33 (1980)