scientific article
From MaRDI portal
Publication:4013526
zbMATH Open0747.68050MaRDI QIDQ4013526FDOQ4013526
Publication date: 27 September 1992
Title of this publication is not available (Why is that?)
Learning and adaptive systems in artificial intelligence (68T05) Formal languages and automata (68Q45) Analysis of algorithms and problem complexity (68Q25)
Cited In (20)
- An average-case optimal one-variable pattern language learner
- Three \(\sum^ P_ 2\)-complete problems in computational learning theory
- Blocksequences of \(k\)-local words
- Learning a subclass of regular patterns in polynomial time
- Learning erasing pattern languages with queries
- Co-learning of recursive languages from positive data
- Polynomial Time Learning of Some Multiple Context-Free Languages with a Minimally Adequate Teacher
- Learning indexed families of recursive languages from positive data: A survey
- Learning one-variable pattern languages very efficiently on average, in parallel, and by asking queries
- Polynomial Time Algorithms for Learning k-Reversible Languages and Pattern Languages with Correction Queries
- From learning in the limit to stochastic finite learning
- On learning unions of pattern languages and tree patterns in the mistake bound model.
- DNA sequencing and string learning
- Learnability of automatic classes
- Separating sets of strings by finding matching patterns is almost always hard
- Title not available (Why is that?)
- Regular patterns, regular languages and context-free languages
- Title not available (Why is that?)
- Title not available (Why is that?)
- Case-based representation and learning of pattern languages
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4013526)
