Name
Abstract | ||
|---|---|---|
This paper concerns an efficient algorithm forlearning in the limit a special type of regular languagescalled locally testable languages from positivedata, and its application to identifying the proteinff-chain region in amino acid sequences. First, wepresent a linear time algorithm that, given a locallytestable language, learns (identifies) its deterministicfinite state automaton in the limit from only positivedata. This provides us with a practical and efficientlearning method for a ... |
Year | Venue | DocType |
|---|---|---|
1994 | HICSS (5) | Conference |
Citations | PageRank | References |
5 | 0.45 | 5 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Takashi Yokomori | 1 | 777 | 93.85 |
| Nobuyuki Ishida | 2 | 5 | 0.45 |
| Satoshi Kobayashi | 3 | 113 | 8.18 |