✦ LIBER ✦

Learning two-tape automata from queries and counterexamples

✍ Scribed by T. Yokomori

Book ID: 112497366
Publisher: Springer
Year: 1996
Tongue: English
Weight: 663 KB
Volume: 29
Category: Article
ISSN: 1433-0490
DOI: 10.1007/bf01201279

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Corrigendum Learning Two-Type Automata f

Corrigendum Learning Two-Type Automata from Queries and Counterexamples

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

Learning finite cover automata from quer

Learning finite cover automata from queries

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

Learning Deterministic Finite Automata f

Learning Deterministic Finite Automata from Smallest Counterexamples

✍ Birkendorf, Andreas; Böker, Andreas; Simon, Hans Ulrich 📂 Article 📅 2000 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 296 KB

On learning from queries and counterexam

On learning from queries and counterexamples in the presence of noise

✍ Yasubumi Sakakibara 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 786 KB

Learning probabilistic automata and Mark

Learning probabilistic automata and Markov chains via queries

✍ Tzeng, Wen-Guey 📂 Article 📅 1992 🏛 Springer 🌐 English ⚖ 922 KB

Learning Sparse Multivariate Polynomials

Learning Sparse Multivariate Polynomials over a Field with Queries and Counterexamples

✍ Robert E. Schapire; Linda M. Sellie 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 520 KB

We consider the problem of learning a polynomial over an arbitrary field F defined on a set of boolean variables. We present the first provably effective algorithm for exactly identifying such polynomials using membership and equivalence queries. Our algorithm runs in time polynomial in n, the numbe