Query learning of bounded-width OBDDs

DOI10.1016/S0304-3975(99)00267-4zbMath0944.68157MaRDI QIDQ5915394

Atsuyoshi Nakamura

Publication date: 21 August 2000

Published in: Theoretical Computer Science (Search for Journal in Brave)

zbMATH Keywords

exact learnability

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05)

Related Items (3)

Inferring Symbolic Automata ⋮ Testing computability by width-two OBDDs ⋮ An efficient query learning algorithm for ordered binary decision diagrams

Cites Work

• Learning regular sets from queries and counterexamples
• When won't membership queries help?
• Learning read-once formulas with queries

This page was built for publication: Query learning of bounded-width OBDDs