The query complexity of learning DFA

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)

zbMATH Keywords

finite automatarandomized learning algorithms

Mathematics Subject Classification ID

Related Items (1)

Even linear simple matrix languages: formal language properties and grammatical inference.

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

This page was built for publication: The query complexity of learning DFA