✦ LIBER ✦

Learning Deterministic Finite Automata from Smallest Counterexamples

✍ Scribed by Birkendorf, Andreas; Böker, Andreas; Simon, Hans Ulrich

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Learning two-tape automata from queries

✍ T. Yokomori 📂 Article 📅 1996 🏛 Springer 🌐 English ⚖ 663 KB

Learning commutative deterministic finit

✍ Naoki Abe 📂 Article 📅 1991 🏛 Springer 🌐 English ⚖ 877 KB

Corrigendum Learning Two-Type Automata f

✍ Yokomori 📂 Article 📅 2002 🏛 Springer 🌐 English ⚖ 41 KB

Learning finite cover automata from quer

✍ Florentin Ipate 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 391 KB

Learning deterministic finite automata w

✍ Lucas, S.M.; Reynolds, T.J. 📂 Article 📅 2005 🏛 IEEE 🌐 English ⚖ 752 KB

Efficient Learning of Typical Finite Aut

✍ Yoav Freund; Michael Kearns; Dana Ron; Ronitt Rubinfeld; Robert E. Schapire; Lin 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 427 KB