Learning indexed families of recursive languages from positive data: A survey
From MaRDI portal
Publication:924177
DOI10.1016/j.tcs.2008.02.030zbMath1146.68387OpenAlexW2024502076MaRDI QIDQ924177
Steffen Lange, Thomas Zeugmann, Sandra Zilles
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.030
Related Items
Robust learning of automatic classes of languages, Automatic learners with feedback queries, Inferring descriptive generalisations of formal languages, A theory of formal synthesis via inductive learning, Iterative learning from texts and counterexamples using additional information, Learning algebraic structures with the help of Borel equivalence relations, Learning figures with the Hausdorff metric by fractals -- towards computable binary classification, Identification in the Limit of k,l-Substitutable Context-Free Languages, Learning families of algebraic structures from informant, Learning recursive functions: A survey, Set systems: order types, continuous nondeterministic deformations, and quasi-orders, Automatic learning of subclasses of pattern languages, Incremental learning with temporary memory, Learning in the limit with lattice-structured hypothesis spaces, On some open problems in monotonic and conservative learning, Learners based on transducers, On the amount of nonconstructivity in learning formal languages from text, Automatic Learners with Feedback Queries, One-shot learners using negative counterexamples and nearest positive examples, Iterative Learning from Texts and Counterexamples Using Additional Information, On the role of update constraints and text-types in iterative learning, Learning languages with decidable hypotheses, Towards a map for incremental learning in the limit from positive and negative information
Uses Software
Cites Work
- Monotonic and dual monotonic language learning
- Polynomial-time inference of arbitrary pattern languages
- A non-learnable class of E-pattern languages
- From learning in the limit to stochastic finite learning
- Learning recursive functions: A survey
- Developments from enquiries into the learnability of the pattern languages from positive data
- Discontinuities in pattern inference
- Learning regular sets from queries and counterexamples
- Finding patterns common to a set of strings
- Equivalence of models for polynomial learnability
- Analogical and inductive inference. International workshop AII '89, Reinhardsbrunn Castle, GDR, October 1-6, 1989. Proceedings
- On the power of inductive inference from good examples
- Generalization and specialization strategies for learning r. e. languages
- Learning recursive languages from good examples
- Lange and Wiehagen's pattern language learning algorithm: An average-case analysis with respect to its total learning time
- Classical recursion theory. Vol. II
- Rich classes inferable from positive data: Length-bounded elementary formal systems
- Characteristic sets for polynomial grammatical inference
- Recent advances of grammatical inference
- Noisy inference and oracles
- Queries revisited.
- An average-case optimal one-variable pattern language learner
- Learning languages and functions by erasing
- Language learning from texts: Degrees of intrinsic complexity and their characterizations
- Incremental learning from positive data
- The synthesis of language learners.
- Incremental concept learning for bounded data mining.
- Variants of iterative learning
- Polynomial-time identification of very simple grammars from positive data.
- Language learning from texts: Mindchanges, limited memory and monotonicity
- Queries and concept learning
- Formal language identification: query learning vs. gold-style learning
- Learning erasing pattern languages with queries
- Relations between Gold-style learning and query learning
- Learning Efficiency of Very Simple Grammars from Positive Data
- Towards a Better Understanding of Incremental Learning
- Characteristic Sets for Inferring the Unions of the Tree Pattern Languages by the Most Fitting Hypotheses
- A theory of the learnable
- On the complexity of inductive inference
- Inductive inference of formal languages from positive data
- Inference of Reversible Languages
- Toward a mathematical theory of inductive inference
- Inductive inference of automata, functions and programs
- Ignoring data may be the only way to learn efficiently
- Learning Theory
- Learning Theory
- Set-driven and rearrangement-independent learning of recursive languages
- 10.1162/153244304773936063
- Algorithmic Learning Theory
- A Machine-Independent Theory of the Complexity of Recursive Functions
- Limiting recursion
- Some decidability results on grammatical inference and complexity
- Language identification in the limit
- Algorithmic Learning Theory
- On the learnability of recursively enumerable languages from good examples
- Synthesizing noise-tolerant language learners
- Learning one-variable pattern languages very efficiently on average, in parallel, and by asking queries
- Synthesizing learners tolerating computable noisy data
- Stochastic finite learning of the pattern languages
- 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
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
