Learnability: Admissible, co-finite, and hypersimple languages

DOI10.1007/3-540-56939-1_80zbMath1418.68109OpenAlexW1640204116MaRDI QIDQ4630268

John Case, Ganesh R. Baliga

Publication date: 29 March 2019

Published in: Automata, Languages and Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-56939-1_80

zbMATH Keywords

inductive inferencelanguage learningrecursive functionlanguage identificationseparation result

Mathematics Subject Classification ID

Computational learning theory (68Q32)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A connotational theory of program structure
• Prudence and other conditions on formal language learning
• Independence results in computer science?
• Gödel numberings of partial recursive functions
• Learning strategies
• Periodicity in generations of automata
• Toward a mathematical theory of inductive inference
• The Power of Vacillation in Language Learning
• Criteria of language learning
• A Machine-Independent Theory of the Complexity of Recursive Functions
• Independent Axiomatization and its Relation to the Hypersimple Set
• Language identification in the limit
• Recursively enumerable sets of positive integers and their decision problems