From learning in the limit to stochastic finite learning
type: Item
instance of: scholarly article
title: From learning in the limit to stochastic finite learning
zbMATH Open document ID: 1153.68022
author: Thomas Zeugmann
published in: Theoretical Computer Science
publication date: 2007-01-09T00:00:00Z
Mathematics Subject Classification ID: 68Q32
zbMATH DE Number: 5083488
zbMATH Keywords: inductive learning
zbMATH Keywords: learning in the limit
zbMATH Keywords: iterative learning
zbMATH Keywords: pattern languages
zbMATH Keywords: learning conjunctive concepts
zbMATH Keywords: average-case analysis
zbMATH Keywords: stochastic finite learning
MaRDI profile type: Publication
full work available at URL: j.tcs.2006.07.042
OpenAlex ID: W2119192035
cites work: Finding patterns common to a set of strings
cites work: Inductive inference of formal languages from positive data
cites work: Learning elementary formal systems
cites work: Toward a mathematical theory of inductive inference
cites work: Learnability and the Vapnik-Chervonenkis dimension
cites work: Incremental concept learning for bounded data mining.
cites work: On the complexity of inductive inference
cites work: Learning one-variable pattern languages very efficiently on average, in parallel, and by asking queries
cites work: Language identification in the limit
cites work: Exact Identification of Read-Once Formulas Using Fixed Points of Amplification Functions
cites work: Equivalence of models for polynomial learnability
cites work: Inclusion is undecidable for pattern languages
cites work: Q4013526
cites work: Polynomial-time inference of arbitrary pattern languages
cites work: Set-driven and rearrangement-independent learning of recursive languages
cites work: Incremental learning from positive data
cites work: Q4843403
cites work: Q4398828
cites work: Q4955303
cites work: Inductive Logic Programming: Theory and methods
cites work: Analogical and inductive inference. International workshop AII '89, Reinhardsbrunn Castle, GDR, October 1-6, 1989. Proceedings
cites work: Q4703441
cites work: An average-case optimal one-variable pattern language learner
cites work: Q4763513
cites work: Q5573961
cites work: Stochastic finite learning of the pattern languages
cites work: Q3664455
cites work: Inductive inference of monotonic formal systems from positive data
cites work: Inductive inference of unbounded unions of pattern languages from positive data
cites work: Theory of Formal Systems. (AM-47)
cites work: A theory of the learnable
cites work: Q4115138
cites work: Ignoring data may be the only way to learn efficiently
cites work: Q4013550
cites work: Lange and Wiehagen's pattern language learning algorithm: An average-case analysis with respect to its total learning time
cites work: Characterizations of monotonic and dual monotonic language learning
DOI: 10.1016/J.TCS.2006.07.042
description: scientific article; zbMATH DE number 5083488