 | 2009 |
|---|
| 54 |       | 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) |
| 2008 |
|---|
| 53 | | 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) |
| 52 | | 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) |
| 51 | | Chengde Mao,
Takashi Yokomori:
Foreword.
Natural Computing 7(2): 145-146 (2008) |
| 50 | | Mihai Ionescu,
Gheorghe Paun,
Takashi Yokomori:
Preface.
Natural Computing 7(4): 451-452 (2008) |
| 2007 |
|---|
| 49 | | 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) |
| 2006 |
|---|
| 48 |  | Chengde Mao,
Takashi Yokomori:
DNA Computing, 12th International Meeting on DNA Computing, DNA12, Seoul, Korea, June 5-9, 2006, Revised Selected Papers
Springer 2006 |
| 47 | | Mihai Ionescu,
Gheorghe Paun,
Takashi Yokomori:
Spiking Neural P Systems.
Fundam. Inform. 71(2-3): 279-308 (2006) |
| 2005 |
|---|
| 46 | | Kaoru Onodera,
Takashi Yokomori:
Linearizer and Doubler : Two Mappings to Unify Molecular Computing Models Based on DNA Complementarity.
DNA 2005: 224-235 |
| 2004 |
|---|
| 45 | | Satoshi Kobayashi,
Takashi Yokomori,
Yasubumi Sakakibara:
An Algorithm for Testing Structure Freeness of Biomolecular Sequences.
Aspects of Molecular Computing 2004: 266-277 |
| 44 | | Leonor Becerra-Bonache,
Takashi Yokomori:
Learning Mild Context-Sensitiveness: Toward Understanding Children's Language Learning.
ICGI 2004: 53-64 |
| 43 | | 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) |
| 2003 |
|---|
| 42 | | Akihiro Takahara,
Takashi Yokomori:
On the computational power of insertion-deletion systems.
Natural Computing 2(4): 321-336 (2003) |
| 41 | | Takashi Yokomori:
Polynomial-time identification of very simple grammars from positive data.
Theor. Comput. Sci. 1(298): 179-206 (2003) |
| 2002 |
|---|
| 40 | | Akihiro Takahara,
Takashi Yokomori:
On the Computational Power of Insertion-Deletion Systems.
DNA 2002: 269-280 |
| 39 | | Takashi Yokomori,
Yasubumi Sakakibara,
Satoshi Kobayashi:
A Magic Pot : Self-assembly Computation Revisited.
Formal and Natural Computing 2002: 418-430 |
| 38 | | Takashi Yokomori:
Corrigendum Learning Two-Type Automata from Queries and Counterexamples.
Theory Comput. Syst. 35(4): 465-466 (2002) |
| 2001 |
|---|
| 37 | | Gheorghe Paun,
Grzegorz Rozenberg,
Takashi Yokomori:
Hairpin Languages.
Int. J. Found. Comput. Sci. 12(6): 837-847 (2001) |
| 36 | | Gheorghe Paun,
Takashi Yokomori:
Toward Soft Hardware.
Soft Comput. 5(2): 93-94 (2001) |
| 2000 |
|---|
| 35 | | Gheorghe Paun,
Takashi Yokomori:
Simulating H Systems by P Systems.
J. UCS 6(1): 178-193 (2000) |
| 34 | | Claudio Ferretti,
Giancarlo Mauri,
Satoshi Kobayashi,
Takashi Yokomori:
On the universality of Post and splicing systems.
Theor. Comput. Sci. 231(2): 157-170 (2000) |
| 1999 |
|---|
| 33 | | Osamu Watanabe,
Takashi Yokomori:
Algorithmic Learning Theory, 10th International Conference, ALT '99, Tokyo, Japan, December 6-8, 1999, Proceedings
Springer 1999 |
| 32 | | Takashi Yokomori:
Computation = self-assembly + conformational change: toward new computing paradigms.
Developments in Language Theory 1999: 32-43 |
| 31 | | Yasuo Uemura,
Aki Hasegawa,
Satoshi Kobayashi,
Takashi Yokomori:
Tree Adjoining Grammars for RNA Structure Prediction.
Theor. Comput. Sci. 210(2): 277-303 (1999) |
| 1998 |
|---|
| 30 | | Tom Head,
Satoshi Kobayashi,
Takashi Yokomori:
Locality, Reversibility, and Beyond: Learning Languages from Positive Data.
ALT 1998: 191-204 |
| 29 | | Claudio Ferretti,
Giancarlo Mauri,
Satoshi Kobayashi,
Takashi Yokomori:
On the Universality of Post and Splicing Systems.
MCU (2) 1998: 12-28 |
| 28 | | 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) |
| 1997 |
|---|
| 27 | | Satoshi Kobayashi,
Takashi Yokomori:
Identifiability of Subspaces and Homomorphic Images of Zero-Reversible Languages.
ALT 1997: 48-61 |
| 26 | | Satoshi Kobayashi,
Takashi Yokomori:
Learning Approximately Regular Languages with Reversible Languages.
Theor. Comput. Sci. 174(1-2): 251-257 (1997) |
| 1996 |
|---|
| 25 | | Satoshi Kobayashi,
Takashi Yokomori:
Families of Noncounting Languages and Their Learnability from Positive Data.
Int. J. Found. Comput. Sci. 7(4): 309- (1996) |
| 24 | | Takashi Yokomori:
Learning Two-Tape Automata from Queries and Counterexamples.
Mathematical Systems Theory 29(3): 259-270 (1996) |
| 1995 |
|---|
| 23 | | Satoshi Kobayashi,
Takashi Yokomori:
On Approximately Identifying Concept Classes in the Limit.
ALT 1995: 298-312 |
| 22 | | Takashi Yokomori:
On Polynomial-Time Learnability in the Limit of Strictly Deterministic Automata.
Machine Learning 19(2): 153-179 (1995) |
| 1994 |
|---|
| 21 | | Satoshi Kobayashi,
Takashi Yokomori:
Learning Concatenations of Locally Testable Languages from Positive Data.
AII/ALT 1994: 407-422 |
| 20 | | Noriyuki Tanida,
Takashi Yokomori:
Inductive Inference of Monogenic Pure Context-free Languages.
AII/ALT 1994: 560-573 |
| 19 | | Takashi Yokomori,
Nobuyuki Ishida,
Satoshi Kobayashi:
Learning Local Languages and its Application to Protein \alpha-Chain Identification.
HICSS (5) 1994: 113-122 |
| 18 | | Takashi Yokomori:
Learning non-deterministic finite automata from queries and counterexamples.
Machine Intelligence 13 1994: 169-189 |
| 1993 |
|---|
| 17 | | Klaus P. Jantke,
Shigenobu Kobayashi,
Etsuji Tomita,
Takashi Yokomori:
Algorithmic Learning Theory, 4th International Workshop, ALT '93, Tokyo, Japan, November 8-10, 1993, Proceedings
Springer 1993 |
| 16 | | Takashi Yokomori:
Learning Two-Tape Automata from Queries and Counterexamples.
COLT 1993: 228-235 |
| 1992 |
|---|
| 15 | | Takashi Yokomori:
On Learning Systolic Languages.
ALT 1992: 41-52 |
| 1991 |
|---|
| 14 | | Takashi Yokomori:
Polynomial-Time Learning of Very Simple Grammars from Positive Data.
COLT 1991: 213-227 |
| 1989 |
|---|
| 13 | | Takashi Yokomori:
Learning Context-Free Languages Efficiently - A Report on Recent Results in Japan.
AII 1989: 104-123 |
| 1987 |
|---|
| 12 | | Takashi Yokomori:
Inductive Inference of Context-free Languages- Context-free Expression Method.
IJCAI 1987: 283-286 |
| 11 | | Takashi Yokomori:
Set Abstraction - An Extension of All Solutions Predicate in Logic Programming Language.
New Generation Comput. 5(3): 227-248 (1987) |
| 10 | | Takashi Yokomori:
On Purely Morphic Characterizations of Context-Free Languages.
Theor. Comput. Sci. 51: 301-308 (1987) |
| 1986 |
|---|
| 9 | | Takashi Yokomori:
On Analogical Query Processing in Logic Database.
VLDB 1986: 376-383 |
| 8 | | Takashi Yokomori:
Logic Program Forms.
New Generation Comput. 4(3): 305-319 (1986) |
| 1985 |
|---|
| 7 | | Takashi Yokomori:
A Logic Program Schema and Its Applications.
IJCAI 1985: 723-725 |
| 6 | | Jiro Tanaka,
Takashi Yokomori,
Makoto Kishishita:
AND-OR Queuing in Extended Concurrent Prolog.
LP 1985: 156-167 |
| 1984 |
|---|
| 5 | | Takashi Yokomori:
A Note on the Set Abstraction in Logic Programming Language.
FGCS 1984: 333-340 |
| 4 | | Takashi Yokomori,
Derick Wood:
An Inverse Homomorphic Characterization of Full Principal AFL.
Inf. Sci. 33(3): 209-215 (1984) |
| 1983 |
|---|
| 3 | | Takashi Yokomori,
Aravind K. Joshi:
Semi-Linearity, Parikh-Boundedness and Tree-Adjunct Languages.
Inf. Process. Lett. 17(3): 137-143 (1983) |
| 1982 |
|---|
| 2 | | 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) |
| 1980 |
|---|
| 1 | | Takashi Yokomori:
Stochastic Characterizations of EOL Languages
Information and Control 45(1): 26-33 (1980) |
