✦ LIBER ✦

Polynomial-time inference of arbitrary pattern languages

✍ Scribed by Steffen Lange; Rolf Wiehagen

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Polynomial time learnability of simple d

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

Bootstrap inference in local polynomial

✍ Maria Lucia Parrella; Cosimo Vitale 📂 Article 📅 2006 🏛 Springer 🌐 English ⚖ 482 KB

Deciding regularity of hairpin completio

✍ Volker Diekert; Steffen Kopecki; Victor Mitrana 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 508 KB

Polynomial-time inference of all valid i

✍ E. Boros; Y. Crama; P. L. Hammer 📂 Article 📅 1990 🏛 Springer Netherlands 🌐 English ⚖ 696 KB

Inference of k-testable languages in the

✍ Garcia, P.; Vidal, E. 📂 Article 📅 1990 🏛 IEEE 🌐 English ⚖ 617 KB

A polynomial-time open-shop problem with

✍ S. V. Sevast'yanov 📂 Article 📅 1992 🏛 Springer US 🌐 English ⚖ 911 KB