 | 2008 |
|---|
| 36 |       | Satoshi Kobayashi:
A New Translation for Semi-classical Theories - Backtracking without CPS.
FLOPS 2008: 210-223 |
| 2007 |
|---|
| 35 | | Cristina Tîrnauca,
Satoshi Kobayashi:
A Characterization of the Language Classes Learnable with Correction Queries.
TAMC 2007: 398-407 |
| 2006 |
|---|
| 34 |  | Yasubumi Sakakibara,
Satoshi Kobayashi,
Kengo Sato,
Tetsuro Nishino,
Etsuji Tomita:
Grammatical Inference: Algorithms and Applications, 8th International Colloquium, ICGI 2006, Tokyo, Japan, September 20-22, 2006, Proceedings
Springer 2006 |
| 33 | | Hendry Muljadi,
Hideaki Takeda,
Aman Shakya,
Shoko Kawamoto,
Satoshi Kobayashi,
Asao Fujiyama,
Koichi Ando:
Semantic Wiki as a Lightweight Knowledge Management System.
ASWC 2006: 65-71 |
| 32 | | Hendry Muljadi,
Hideaki Takeda,
Shoko Kawamoto,
Satoshi Kobayashi,
Asao Fujiyama:
Towards a Semantic Wiki-Based Japanese Biodictionary.
SemWiki 2006 |
| 31 | | Satoshi Kobayashi:
Mathematical Foundations of Learning Theory.
Recent Advances in Formal Languages and Applications 2006: 209-228 |
| 2005 |
|---|
| 30 | | Atsushi Kijima,
Satoshi Kobayashi:
Efficient Algorithm for Testing Structure Freeness of Finite Set of Biomolecular Sequences.
DNA 2005: 171-180 |
| 29 | | Shinnosuke Seki,
Satoshi Kobayashi:
A Grammatical Approach to the Alignment of Structure-Annotated Strings.
IEICE Transactions 88-D(12): 2727-2737 (2005) |
| 2004 |
|---|
| 28 | | Satoshi Kobayashi,
Takashi Yokomori,
Yasubumi Sakakibara:
An Algorithm for Testing Structure Freeness of Biomolecular Sequences.
Aspects of Molecular Computing 2004: 266-277 |
| 27 | | Satoshi Kobayashi:
Testing Structure Freeness of Regular Sets of Biomolecular Sequences.
DNA 2004: 192-201 |
| 26 | | Shinnosuke Seki,
Satoshi Kobayashi:
Efficient Learning of k-Reversible Context-Free Grammars from Positive Structural Examples.
ICGI 2004: 285-287 |
| 2002 |
|---|
| 25 | | Satoshi Kobayashi,
Tomohiro Kondo,
Masanori Arita:
On Template Method for DNA Sequence Design.
DNA 2002: 205-214 |
| 24 | | Takashi Yokomori,
Yasubumi Sakakibara,
Satoshi Kobayashi:
A Magic Pot : Self-assembly Computation Revisited.
Formal and Natural Computing 2002: 418-430 |
| 23 | | Masanori Arita,
Satoshi Kobayashi:
DNA Sequence Design Using Templates.
New Generation Comput. 20(3): 263-278 (2002) |
| 2001 |
|---|
| 22 | | Hiroki Uejima,
Masami Hagiya,
Satoshi Kobayashi:
Horn Clause Computation by Self-assembly of DNA Molecules.
DNA 2001: 308-320 |
| 21 | | Yasubumi Sakakibara,
Satoshi Kobayashi:
Sticker systems with complex structures.
Soft Comput. 5(2): 114-120 (2001) |
| 20 | | Satoshi Kobayashi,
Victor Mitrana,
Gheorghe Paun,
Grzegorz Rozenberg:
Formal properties of PA-matching.
Theor. Comput. Sci. 262(1): 117-131 (2001) |
| 19 | | Satoshi Kobayashi,
Yasubumi Sakakibara:
Multiple splicing systems and the universal computability.
Theor. Comput. Sci. 264(1): 3-23 (2001) |
| 2000 |
|---|
| 18 | | Satoshi Kobayashi:
Iterated Transductions and Efficient Learning from Positive Data: A Unifying View.
ICGI 2000: 157-170 |
| 17 | | 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 |
|---|
| 16 | | Satoshi Kobayashi:
Horn Clause Computation with DNA Molecules.
J. Comb. Optim. 3(2-3): 277-299 (1999) |
| 15 | | Yasuo Uemura,
Aki Hasegawa,
Satoshi Kobayashi,
Takashi Yokomori:
Tree Adjoining Grammars for RNA Structure Prediction.
Theor. Comput. Sci. 210(2): 277-303 (1999) |
| 1998 |
|---|
| 14 | | Tom Head,
Satoshi Kobayashi,
Takashi Yokomori:
Locality, Reversibility, and Beyond: Learning Languages from Positive Data.
ALT 1998: 191-204 |
| 13 | | Claudio Ferretti,
Giancarlo Mauri,
Satoshi Kobayashi,
Takashi Yokomori:
On the Universality of Post and Splicing Systems.
MCU (2) 1998: 12-28 |
| 12 | | 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 |
|---|
| 11 | | Satoshi Kobayashi,
Takashi Yokomori:
Identifiability of Subspaces and Homomorphic Images of Zero-Reversible Languages.
ALT 1997: 48-61 |
| 10 | | Satoshi Kobayashi,
Takashi Yokomori:
Learning Approximately Regular Languages with Reversible Languages.
Theor. Comput. Sci. 174(1-2): 251-257 (1997) |
| 9 | | Satoshi Kobayashi:
Monad as Modality.
Theor. Comput. Sci. 175(1): 29-74 (1997) |
| 1996 |
|---|
| 8 | | Susumu Hayashi,
Masakazu Ishikawa,
Satoshi Kobayashi,
Hiroshi Nakano,
Syuichi Nakazaki:
Two Extensions of PX system.
Electr. Notes Theor. Comput. Sci. 3: (1996) |
| 7 | | Satoshi Kobayashi,
Takashi Yokomori:
Families of Noncounting Languages and Their Learnability from Positive Data.
Int. J. Found. Comput. Sci. 7(4): 309- (1996) |
| 1995 |
|---|
| 6 | | Satoshi Kobayashi,
Takashi Yokomori:
On Approximately Identifying Concept Classes in the Limit.
ALT 1995: 298-312 |
| 1994 |
|---|
| 5 | | Satoshi Kobayashi,
Takashi Yokomori:
Learning Concatenations of Locally Testable Languages from Positive Data.
AII/ALT 1994: 407-422 |
| 4 | | Takashi Yokomori,
Nobuyuki Ishida,
Satoshi Kobayashi:
Learning Local Languages and its Application to Protein \alpha-Chain Identification.
HICSS (5) 1994: 113-122 |
| 3 | | Satoshi Kobayashi,
Makoto Tatsuta:
Realizability Interpretation of Generalized Inductive Definitions.
Theor. Comput. Sci. 131(1): 121-138 (1994) |
| 1993 |
|---|
| 2 | | Satoshi Kobayashi:
Learning Strategies Using Decision Lists.
ALT 1993: 370-383 |
| 1 | | Satoshi Kobayashi,
Koichi Hori,
Setsuo Ohsuga:
Learning Decision Lists over Tree Patterns and Its Application.
IJCAI 1993: 995-1001 |
