Name
Abstract | ||
|---|---|---|
A one-sided classier for a given class of languages converges to 1 on every language from theclass and outputs 0 innitely often on languages outside the class. A two-sided classier, onthe other hand, converges to 1 on languages from the class and converges to 0 on languagesoutside the class. The present paper investigates one-sided and two-sided classication forclasses of computable languages. Theorems are presented that help assess the classiabilityof natural classes. The... |
Year | DOI | Venue |
|---|---|---|
1997 | 10.1007/BFb0023462 | STACS |
Keywords | Field | DocType |
computable languages | Inductive reasoning,Discrete mathematics,Structural complexity theory,Combinatorics,Computer science,Abstract family of languages,Finite-state machine,Pattern language,Turing,Classifier (linguistics),Special case | Conference |
Volume | ISSN | ISBN |
1200 | 0302-9743 | 3-540-62616-6 |
Citations | PageRank | References |
8 | 0.50 | 18 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| John Case | 1 | 169 | 13.65 |
| Efim Kinber | 2 | 421 | 44.95 |
| Arun Sharma | 3 | 185 | 19.42 |
| Frank Stephan | 4 | 313 | 28.88 |