Polynomial-time inference of arbitrary pattern languages
type: Item
instance of: scholarly article
title: Polynomial-time inference of arbitrary pattern languages
zbMATH Open document ID: 0712.68082
DOI: 10.1007/BF03037093
author: S. Lange
author: Rolf Wiehagen
published in: New Generation Computing
publication date: 1991-01-01T00:00:00Z
Mathematics Subject Classification ID: 68T05
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 03B48
zbMATH DE Number: 4172422
zbMATH Keywords: machine learning
zbMATH Keywords: inductive inference
zbMATH Keywords: polynomial-time complexity
MaRDI profile type: Publication
cites work: Finding patterns common to a set of strings
cites work: Toward a mathematical theory of inductive inference
cites work: On the power of inductive inference from good examples
cites work: Language identification in the limit
cites work: Research in the theory of inductive inference by GDR mathematicians - A survey
description: scientific article; zbMATH DE number 4172422