Learning languages and functions by erasing
From MaRDI portal
Publication:1575464
DOI10.1016/S0304-3975(99)00269-8zbMATH Open0944.68095OpenAlexW1991858718WikidataQ127374550 ScholiaQ127374550MaRDI QIDQ1575464FDOQ1575464
Authors: Sanjay Jain, Thomas Zeugmann, Efim Kinber, S. Lange, Rolf Wiehagen 
Publication date: 21 August 2000
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0304-3975(99)00269-8
Recommendations
- Learning by erasing
- scientific article; zbMATH DE number 2080442
- Learning erasing pattern languages with queries
- Learning Behaviors of Functions
- scientific article; zbMATH DE number 67617
- Grammatical Inference: Algorithms and Applications
- Algorithmic Learning Theory
- Learning Left-to-Right and Right-to-Left Iterative Languages
- LEARNING RECURSIVE LANGUAGES WITH BOUNDED MIND CHANGES
- Learning languages with decidable hypotheses
Cites Work
- Inductive inference of formal languages from positive data
- Toward a mathematical theory of inductive inference
- Title not available (Why is that?)
- Title not available (Why is that?)
- Language identification in the limit
- A Machine-Independent Theory of the Complexity of Recursive Functions
- Title not available (Why is that?)
- Characterizations of monotonic and dual monotonic language learning
- Comparison of identification criteria for machine inductive inference
- Learning by erasing
- LEARNING RECURSIVE LANGUAGES WITH BOUNDED MIND CHANGES
- Research in the theory of inductive inference by GDR mathematicians - A survey
- Title not available (Why is that?)
- Title not available (Why is that?)
- Enumerations of families of general recursive functions
- Characterizing language identification by standardizing operations
- Characterization of language learning front informant under various monotonicity constraints
- Title not available (Why is that?)
- A learning-theoretic characterization of classes of recursive functions
- Language learning without overgeneralization
- Title not available (Why is that?)
- Inductive inference of recursive functions: qualitative theory
- How inductive inference strategies discover their errors
- Kolmogorov numberings and minimal identification
- On learning and co-learning of minimal programs
- AN INFINITE CLASS OF FUNCTIONS IDENTIFIABLE USING MINIMAL PROGRAMS IN ALL KOLMOGOROV NUMBERINGS
Cited In (6)
- Learning erasing pattern languages with queries
- Learning indexed families of recursive languages from positive data: A survey
- Learning of erasing primitive formal systems from positive examples
- A solution to Wiehagen's thesis
- On the amount of nonconstructivity in learning formal languages from text
- Learning by erasing
This page was built for publication: Learning languages and functions by erasing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1575464)
