An average-case optimal one-variable pattern language learner
From MaRDI portal
Publication:1567401
DOI10.1006/jcss.1999.1669zbMath0955.68098OpenAlexW2015481793MaRDI QIDQ1567401
Thomas Zeugmann, K. Ruediger Reischuk
Publication date: 5 June 2000
Published in: Journal of Computer and System Sciences (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/18e1b9c53a21115072177d0b7995322f0d90ac11
Related Items
From learning in the limit to stochastic finite learning ⋮ Learning a subclass of regular patterns in polynomial time ⋮ Inferring descriptive generalisations of formal languages ⋮ Feasible Iteration of Feasible Learning Functionals ⋮ Developments from enquiries into the learnability of the pattern languages from positive data ⋮ Discontinuities in pattern inference ⋮ Learning indexed families of recursive languages from positive data: A survey ⋮ Patterns with bounded treewidth ⋮ Resource restricted computability theoretic learning: Illustrative topics and problems ⋮ Learning erasing pattern languages with queries
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Polynomial-time inference of arbitrary pattern languages
- Finding patterns common to a set of strings
- Lange and Wiehagen's pattern language learning algorithm: An average-case analysis with respect to its total learning time
- Incremental learning from positive data
- Incremental concept learning for bounded data mining.
- Learnability and the Vapnik-Chervonenkis dimension
- A theory of the learnable
- On the complexity of inductive inference
- Ignoring data may be the only way to learn efficiently
- On the impact of forgetting on learning machines
- Set-driven and rearrangement-independent learning of recursive languages
- Language identification in the limit
- Learning one-variable pattern languages very efficiently on average, in parallel, and by asking queries
