The query complexity of learning DFA
From MaRDI portal
Publication:1336037
DOI10.1007/BF03037351zbMath0812.68107MaRDI QIDQ1336037
Ricard Gavaldà, José L. Balcázar, Osamu Watanabe, Josep Diaz
Publication date: 20 November 1994
Published in: New Generation Computing (Search for Journal in Brave)
68T05: Learning and adaptive systems in artificial intelligence
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Prediction-preserving reducibility
- Learning regular sets from queries and counterexamples
- When won't membership queries help?
- Asking questions to minimize errors
- A theory of the learnable
- A framework for polynomial-time query learnability
- Cryptographic limitations on learning Boolean formulae and finite automata
- Language identification in the limit