Synthesizing learners tolerating computable noisy data

DOI10.1006/JCSS.2000.1736MaRDI QIDQ5943099zbMATH OpenOpenAlexFDO

Authors John Case, Sanjay Jain

Publication date 9 September 2001

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

Full work available at URL https://doi.org/10.1006/jcss.2000.1736

zbMATH Keywords

learnability of grammarsrecursive languages

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42) Formal languages and automata (68Q45)

Recommendations

• scientific article; zbMATH DE number 1301792
• scientific article; zbMATH DE number 4049026
• Synthesizing noise-tolerant language learners
• The synthesis of language learners.
• Vacillatory and BC learning on noisy data

Cites work

• A Machine-Independent Theory of the Complexity of Recursive Functions
• Characterizations of monotonic and dual monotonic language learning
• Classical recursion theory. Vol. II
• Comparison of identification criteria for machine inductive inference
• Computational Complexity of Probabilistic Turing Machines
• scientific article; zbMATH DE number 3817068 (Why is no real title available?)
• 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 4070321 (Why is no real title available?)
• scientific article; zbMATH DE number 4091484 (Why is no real title available?)
• scientific article; zbMATH DE number 3681745 (Why is no real title available?)
• scientific article; zbMATH DE number 3702094 (Why is no real title available?)
• scientific article; zbMATH DE number 48157 (Why is no real title available?)
• scientific article; zbMATH DE number 67629 (Why is no real title available?)
• scientific article; zbMATH DE number 3584924 (Why is no real title available?)
• scientific article; zbMATH DE number 680708 (Why is no real title available?)
• scientific article; zbMATH DE number 784360 (Why is no real title available?)
• scientific article; zbMATH DE number 3323530 (Why is no real title available?)
• Incremental concept learning for bounded data mining.
• Inductive inference of formal languages from positive data
• Inductive inference of monotonic formal systems from positive data
• Inductive Logic Programming: Theory and methods
• Language identification in the limit
• Language learning without overgeneralization
• Learning elementary formal systems
• Learning in the presence of inaccurate information
• Monadic Elementary Formal Systems
• Monotonic and dual monotonic language learning
• Periodicity in generations of automata
• Program synthesis in the presence of infinite number of inaccuracies
• Research in the theory of inductive inference by GDR mathematicians - A survey
• Spatial/kinematic domain and lattice computers
• Synthesizing inductive expertise
• Synthesizing noise-tolerant language learners
• The Power of Vacillation in Language Learning
• The synthesis of language learners.
• Toward a mathematical theory of inductive inference
• Vacillatory and BC learning on noisy data

Cited in

(7)

• The synthesis of language learners.
• Supervised learning from noisy observations: combining machine-learning techniques with data assimilation
• Learning families of closed sets in matroids
• scientific article; zbMATH DE number 1301792 (Why is no real title available?)
• scientific article; zbMATH DE number 970621 (Why is no real title available?)
• Synthesizing noise-tolerant language learners
• Learning indexed families of recursive languages from positive data: A survey

This page was built for publication: Synthesizing learners tolerating computable noisy data

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