Satoshi Kobayashi, Takashi Yokomori  Home/Search
Context
Related
| ylabgw.cs.uec.ac.jp/Pape...alt94.ps.gz Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: ylabgw.cs.uec.ac.jp/Papers/ (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: This paper introduces the class of concatenations of locally testable languages and its subclasses, and presents some results on the learnability of the classes from positive data. We first establish several relationships among the language classes introduced, and give a sufficient condition for a concatenation operation to preserve finite elasticity of a language class C. Then we show that, for each k, the class CLT k , a subclass of concatenations of locally testable languages, is... (Update)
Active bibliography (related documents): More All
0.6: Learning Local Languages and Its Application to Protein .. - Yokomori, Ishida.. (1996) (Correct)
0.3: Angluin's Theorem for Indexed Families of R.e. Sets and.. - de Jongh, Kanazawa (1996) (Correct)
0.3: On Approximately Identifying Concept Classes in the Limit - Kobayashi, Yokomori (1995) (Correct)
Similar documents based on text: More All
0.6: Some Language Classes Identifiable in the Limit from.. - Denis, Lemay, Terlutte (2002) (Correct)
0.5: Locally Testable Codes and PCPs of Almost-Linear Length - Goldreich, Sudan (2002) (Correct)
0.3: Locally Aligned Terminal Distinguishable Languages And .. - Seshu, G.Nagaraja.. (2002) (Correct)
BibTeX entry: (Update)
@inproceedings{ kobayashi94learning,
author = "Satoshi Kobayashi and Takashi Yokomori",
title = "Learning Concatenations of Locally Testable Languages from Positive Data",
booktitle = "Algorithmic Learning Theory, 4th International Workshop on Analogical and Inductive Inference, {AII} '94, 5th International Workshop on Algorithmic Learning Theory, {ALT} '94, Reinhardsbrunn Castle, Germany, October 1994, Proceedings",
volume = "872",
publisher = "Springer-Verlag",
pages = "407--422",
year = "1994",
url = "citeseer.ist.psu.edu/kobayashi94learning.html" }
Citations (may not include all citations):412 Language identification in the limit (context) - Gold - 1967
156 Inductive inference of formal languages from positive data (context) - Angluin - 1980
127 Counter-Free Automata (context) - McNaughton, Papert - 1971
113 Toward a Mathematical Theory of Inductive Inference (context) - Blum, Blum - 1975
91 Formal language theory and DNA : An analysis of the generati.. (context) - Head - 1987
74 Inference of reversible languages (context) - Angluin - 1982
28 Language Learning in Dependence on the Space of Hypotheses - Lange, Zeugmann - 1993
21 Identification of unions of languages drawn from an identifi.. (context) - Wright - 1989
8 The correct definition of finite elasticity: corrigendum to .. (context) - Motoki, Shinohara et al. - 1991
8 Learning Local Languages and Its Application to Protein ff-c.. - Yokomori, Ishida et al. - 1994
6 Properties of Language Classes with Finite Elasticity (context) - Moriyama, Sato - 1993
2 A note on the polynomial-time identification of strictly loc.. (context) - Yokomori - 1990
Documents on the same site (http://ylab-gw.cs.uec.ac.jp/Papers/): More
Learning Two-Tape Automata from Queries and Counterexamples - Yokomori (1996) (Correct)
Learning Non-deterministic Finite Automata from Queries and.. - Yokomori (1993) (Correct)
Inductive Learning of Regular Sets from Examples: A Rough.. - Yokomori, Kobayashi (1994) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC