Name
Abstract | ||
|---|---|---|
This paper introduces the class of concatenations of locally testablelanguages and its subclasses, and presents some results on the learnabilityof the classes from positive data. We first establish several relationshipsamong the language classes introduced, and give a sufficient conditionfor a concatenation operation to preserve finite elasticity of a languageclass C. Then we show that, for each k, the class CLTk, a subclassof concatenations of locally testable languages, is... |
Year | DOI | Venue |
|---|---|---|
1994 | 10.1007/3-540-58520-6_80 | AII/ALT |
Keywords | Field | DocType |
testable languages,learning concatenations,positive data | Discrete mathematics,Subclass,Sequence,Computer science,Automaton,Concatenation,Artificial intelligence,Regular language,Time complexity,Learnability,Machine learning | Conference |
ISBN | Citations | PageRank |
3-540-58520-6 | 4 | 0.45 |
References | Authors | |
10 | 2 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Satoshi Kobayashi | 1 | 113 | 8.18 |
| Takashi Yokomori | 2 | 777 | 93.85 |