✦ LIBER ✦

On uniform learnability of language families

✍ Scribed by Shyam Kapur; Gianfranco Bilardi

Book ID: 107766090
Publisher: Elsevier Science
Year: 1992
Tongue: English
Weight: 341 KB
Volume: 44
Category: Article
ISSN: 0020-0190
DOI: 10.1016/0020-0190(92)90252-q

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A Hierarchy of Language Families Learnab

A Hierarchy of Language Families Learnable by Regular Language Learning

✍ Y. Takada 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 561 KB

Uniform characterizations of polynomial-

Uniform characterizations of polynomial-query learnabilities

✍ Yosuke Hayashi; Satoshi Matsumoto; Ayumi Shinohara; Masayuki Takeda 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 115 KB

Polynomial time learnability of simple d

Polynomial time learnability of simple deterministic languages

✍ Ishizaka, Hiroki 📂 Article 📅 1990 🏛 Springer 🌐 English ⚖ 753 KB

Polynomial Time Learnability of Simple D

Polynomial Time Learnability of Simple Deterministic Languages

✍ Ishizaka, Hiroki 📂 Article 📅 1990 🏛 Springer 🌐 English ⚖ 794 KB

A non-learnable class of E-pattern langu

A non-learnable class of E-pattern languages

✍ Daniel Reidenbach 📂 Article 📅 2006 🏛 Elsevier Science 🌐 English ⚖ 250 KB

Closure properties of uniform convergenc

Closure properties of uniform convergence of empirical means and PAC learnability under a family of probability measures

✍ M. Vidyasagar; S. Balaji; B. Hammer 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 107 KB

Open Problem No. 12.2 of (Vidyasagar, A Theory of Learning and Generalization: with Application to Neural Networks and Control Systems, Springer, London, 1997) asks: "Are the properties of uniform convergence of empirical means, and learnability preserved when the family of probability measures is r