Synthesizing learners tolerating computable noisy data

DOI10.1006/JCSS.2000.1736zbMath0990.68083OpenAlexW2053823282MaRDI QIDQ5943099

Sanjay Jain, John Case

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

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

Related Items (2)

Learning Families of Closed Sets in Matroids ⋮ Learning indexed families of recursive languages from positive data: A survey

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Comparison of identification criteria for machine inductive inference
• Monotonic and dual monotonic language learning
• Language learning without overgeneralization
• Program synthesis in the presence of infinite number of inaccuracies
• Inductive inference of monotonic formal systems from positive data
• Synthesizing inductive expertise
• Research in the theory of inductive inference by GDR mathematicians - A survey
• Learning elementary formal systems
• Classical recursion theory. Vol. II
• Learning in the presence of inaccurate information
• The synthesis of language learners.
• Incremental concept learning for bounded data mining.
• Characterizations of monotonic and dual monotonic language learning
• Inductive inference of formal languages from positive data
• Periodicity in generations of automata
• Computational Complexity of Probabilistic Turing Machines
• Toward a mathematical theory of inductive inference
• The Power of Vacillation in Language Learning
• Spatial/kinematic domain and lattice computers
• Inductive Logic Programming: Theory and methods
• A Machine-Independent Theory of the Complexity of Recursive Functions
• Monadic Elementary Formal Systems
• Language identification in the limit
• Vacillatory and BC learning on noisy data
• Synthesizing noise-tolerant language learners

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