An average-case optimal one-variable pattern language learner
type: Item
instance of: scholarly article
title: An average-case optimal one-variable pattern language learner
zbMATH Open document ID: 0955.68098
author: Thomas Zeugmann
author: Rüdiger Reischuk
published in: Journal of Computer and System Sciences
publication date: 2000-06-05T00:00:00Z
Mathematics Subject Classification ID: 68T05
zbMATH DE Number: 1455737
zbMATH Keywords: total learning time
zbMATH Keywords: probabilistic finite learner
MaRDI profile type: Publication
OpenAlex ID: W2015481793
cites work: Finding patterns common to a set of strings
cites work: Learnability and the Vapnik-Chervonenkis dimension
cites work: Incremental concept learning for bounded data mining.
cites work: Q4849531
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: On the impact of forgetting on learning machines
cites work: Language identification in the limit
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: Q4955303
cites work: Q4763513
cites work: A theory of the learnable
cites work: Ignoring data may be the only way to learn efficiently
cites work: Lange and Wiehagen's pattern language learning algorithm: An average-case analysis with respect to its total learning time
DOI: 10.1006/JCSS.1999.1669
description: scientific article; zbMATH DE number 1455737