On uniform learnability of language families

DOI10.1016/0020-0190(92)90252-QzbMath0794.68128MaRDI QIDQ1195860

Shyam Kapur, Gianfranco Bilardi

Publication date: 4 January 1993

Published in: Information Processing Letters (Search for Journal in Brave)

zbMATH Keywords

computational learningtheory of computationrecursive language families

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Formal languages and automata (68Q45)

Related Items (7)

An approach to intrinsic complexity of uniform learning ⋮ Learning theory in the arithmetic hierarchy. II. ⋮ Learning Bounded Unions of Noetherian Closed Set Systems Via Characteristic Sets ⋮ Separation of uniform learning classes. ⋮ Increasing the power of uniform inductive learners ⋮ Learning algebraic structures from text ⋮ The complexity of universal text-learners.

Cites Work

• Inductive inference of formal languages from positive data
• Language identification in the limit
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On uniform learnability of language families