scientific article
From MaRDI portal
Publication:4013526
zbMath0747.68050MaRDI QIDQ4013526
Publication date: 27 September 1992
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Learning and adaptive systems in artificial intelligence (68T05) Formal languages and automata (68Q45)
Related Items
Blocksequences of \(k\)-local words ⋮ DNA sequencing and string learning ⋮ From learning in the limit to stochastic finite learning ⋮ Learning a subclass of regular patterns in polynomial time ⋮ Regular patterns, regular languages and context-free languages ⋮ Polynomial Time Algorithms for Learning k-Reversible Languages and Pattern Languages with Correction Queries ⋮ Learning indexed families of recursive languages from positive data: A survey ⋮ Case-based representation and learning of pattern languages ⋮ Separating sets of strings by finding matching patterns is almost always hard ⋮ Three \(\sum^ P_ 2\)-complete problems in computational learning theory ⋮ Learnability of automatic classes ⋮ Learning one-variable pattern languages very efficiently on average, in parallel, and by asking queries ⋮ Unnamed Item ⋮ An average-case optimal one-variable pattern language learner ⋮ Unnamed Item ⋮ On learning unions of pattern languages and tree patterns in the mistake bound model. ⋮ Learning erasing pattern languages with queries
This page was built for publication:
