scientific article
From MaRDI portal
Publication:3335016
zbMath0545.68078MaRDI QIDQ3335016
Publication date: 1984
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
polynomial timeinductive inferencepattern inferencegeneral pattern languagesinductively learning patterns
Analysis of algorithms and problem complexity (68Q25) Learning and adaptive systems in artificial intelligence (68T05) Pattern recognition, speech recognition (68T10) Complexity of computation (including implicit computational complexity) (03D15)
Related Items (7)
Identification of pattern languages from examples and queries ⋮ A note on the two-variable pattern-finding problem ⋮ Developments from enquiries into the learnability of the pattern languages from positive data ⋮ Case-based representation and learning of pattern languages ⋮ Learning one-variable pattern languages very efficiently on average, in parallel, and by asking queries ⋮ On the language equivalence of NE star-patterns ⋮ On learning unions of pattern languages and tree patterns in the mistake bound model.
This page was built for publication:
