Characterizing language identification by standardizing operations

DOI10.1016/S0022-0000(05)80088-1MaRDI QIDQ1333402zbMATH OpenOpenAlexFDO

Authors Sanjay Jain, A. K. Sharma

Publication date 13 October 1994

Published in Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0022-0000(05)80088-1

zbMATH Keywords

algorithmic identificationlanguage learning theory

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Learning and adaptive systems in artificial intelligence (68T05) Natural language processing (68T50)

Recommendations

• scientific article; zbMATH DE number 4057035
• scientific article; zbMATH DE number 3932417
• Characterizing language identification in terms of computable numberings
• Algorithmic Learning Theory
• Investigations on measure-one identification of classes of languages

Cites work

• A Machine-Independent Theory of the Complexity of Recursive Functions
• CONNECTIONS BETWEEN IDENTIFYING FUNCTIONALS, STANDARDIZING OPERATIONS, AND COMPUTABLE NUMBERINGS
• Gödel numberings of partial recursive functions
• scientific article; zbMATH DE number 3664335 (Why is no real title available?)
• scientific article; zbMATH DE number 67619 (Why is no real title available?)
• scientific article; zbMATH DE number 3497878 (Why is no real title available?)
• scientific article; zbMATH DE number 3515457 (Why is no real title available?)
• scientific article; zbMATH DE number 3291134 (Why is no real title available?)
• Language identification in the limit
• Learning in the presence of partial explanations
• Learning with the knowledge of an upper bound on program size
• Note on a central lemma for learning theory
• On the power of inductive inference from good examples
• Saving the phenomena: Requirements that inductive inference machines not contradict known data
• Toward a mathematical theory of inductive inference
• Tradeoffs in the inductive inference of nearly minimal size programs

Cited in

(11)

• Investigations on measure-one identification of classes of languages
• Identifying terminal distinguishable languages
• Learning languages and functions by erasing
• Language learning from texts: Degrees of intrinsic complexity and their characterizations
• Inductive inference and computable numberings
• Effectivity questions for Kleene's recursion theorem
• scientific article; zbMATH DE number 4057035 (Why is no real title available?)
• Normal forms in semantic language identification
• Prudence in vacillatory language identification
• Synthesizing noise-tolerant language learners
• Characterizing language identification in terms of computable numberings

This page was built for publication: Characterizing language identification by standardizing operations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1333402)