Learning and extending sublanguages

DOI10.1016/J.TCS.2008.02.031MaRDI QIDQ924178zbMATH OpenOpenAlexFDO

Authors Sanjay Jain, Efim Kinber

Publication date 28 May 2008

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.tcs.2008.02.031

zbMATH Keywords

inductive inferencelearning sublanguages

Mathematics Subject Classification ID

Computational learning theory (68Q32) Formal languages and automata (68Q45)

Recommendations

• Learning and Extending Sublanguages
• Characterizations of monotonic and dual monotonic language learning
• Language learning from texts: Mindchanges, limited memory and monotonicity
• Learning power and language expressiveness.
• Monotonic and dual monotonic language learning

Cites work

• A Machine-Independent Theory of the Complexity of Recursive Functions
• Comparison of identification criteria for machine inductive inference
• Criteria of language learning
• Finding patterns common to a set of strings
• Generalization and specialization strategies for learning r. e. languages
• Gödel numberings of partial recursive functions
• scientific article; zbMATH DE number 3932417 (Why is no real title available?)
• scientific article; zbMATH DE number 3984608 (Why is no real title available?)
• scientific article; zbMATH DE number 3664335 (Why is no real title available?)
• scientific article; zbMATH DE number 3586480 (Why is no real title available?)
• scientific article; zbMATH DE number 517033 (Why is no real title available?)
• scientific article; zbMATH DE number 1104343 (Why is no real title available?)
• scientific article; zbMATH DE number 2077180 (Why is no real title available?)
• scientific article; zbMATH DE number 3291134 (Why is no real title available?)
• Inductive inference of formal languages from positive data
• Language identification in the limit
• Learning all subfunctions of a function
• Learning and Extending Sublanguages
• Learning approximately regular languages with reversible languages
• Learning in the presence of inaccurate information
• Monotonic and non-monotonic inductive inference
• Noisy inference and oracles
• On the impact of forgetting on learning machines
• Toward a mathematical theory of inductive inference

Cited in

(12)

• Learning with the knowledge of an upper bound on program size
• Experience, generations, and limits in machine learning
• Learning power and language expressiveness.
• Characterizations of monotonic and dual monotonic language learning
• scientific article; zbMATH DE number 1670714 (Why is no real title available?)
• Learning strategies
• Learning and Extending Sublanguages
• Inferring descriptive generalisations of formal languages
• scientific article; zbMATH DE number 1897144 (Why is no real title available?)
• Learning all subfunctions of a function.
• Learning all subfunctions of a function
• Monotonic and dual monotonic language learning

This page was built for publication: Learning and extending sublanguages

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