Learnability: Admissible, co-finite, and hypersimple languages

Ganesh Baliga, John Case

Research output: Chapter in Book/Report/Conference proceedingConference contribution

2 Scopus citations

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.

Original languageEnglish (US)
Title of host publicationAutomata, Languages and Programming - 20th International Colloquium, ICALP 1993, Proceedings
EditorsAndrzej Lingas, Rolf Karlsson, Svante Carlsson
PublisherSpringer Verlag
Pages289-300
Number of pages12
ISBN (Print)9783540569398
DOIs
StatePublished - 1993
Externally publishedYes
Event20th International Colloquium on Automata, Languages and Programming, ICALP 1993 - Lund, Sweden
Duration: Jul 5 1993Jul 9 1993

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume700 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Other

Other20th International Colloquium on Automata, Languages and Programming, ICALP 1993
Country/TerritorySweden
CityLund
Period7/5/937/9/93

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint

Dive into the research topics of 'Learnability: Admissible, co-finite, and hypersimple languages'. Together they form a unique fingerprint.

Cite this