✦ LIBER ✦

Polynomial time learnability of simple deterministic languages

✍ Scribed by Ishizaka, Hiroki

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Polynomial-time inference of arbitrary p

✍ Steffen Lange; Rolf Wiehagen 📂 Article 📅 1991 🏛 Springer 🌐 English ⚖ 480 KB

An explicit separation of relativised ra

✍ Richard Zippel 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 862 KB

A hierarchy of real-time deterministic l

✍ Amiram Yehudai 📂 Article 📅 1982 🏛 Elsevier Science 🌐 English ⚖ 504 KB

Deciding regularity of hairpin completio

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

Deterministic Polynomial-Time Equivalenc

✍ Jean-Sebastien Coron; Alexander May 📂 Article 📅 2006 🏛 Springer 🌐 English ⚖ 230 KB

P-selective sets, tally languages, and t

✍ Alan L. Selman 📂 Article 📅 1979 🏛 Springer 🌐 English ⚖ 677 KB