@inproceedings{f8ec15d0914348a0b4967cc8d25fdf83,
title = "Learnability: Admissible, co-finite, and hypersimple languages",
abstract = "Presented is a surprising characterization of hyper simple sets in algorithmic learning theory. It is used herein to obtain an elegant, tight separation result for learnability criteria. It is argued that such separation results may yield insight for eventual characterizations.",
author = "Ganesh Baliga and John Case",
year = "1993",
doi = "10.1007/3-540-56939-1_80",
language = "English (US)",
isbn = "9783540569398",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "289--300",
editor = "Andrzej Lingas and Rolf Karlsson and Svante Carlsson",
booktitle = "Automata, Languages and Programming - 20th International Colloquium, ICALP 1993, Proceedings",
address = "Germany",
note = "20th International Colloquium on Automata, Languages and Programming, ICALP 1993 ; Conference date: 05-07-1993 Through 09-07-1993",
}