A simple algorithm for learning O(log n)-term DNF

DOI10.1016/S0020-0190(97)00026-4zbMath0925.68357MaRDI QIDQ1392215

Eyal Kushilevitz

Publication date: 23 July 1998

Published in: Information Processing Letters (Search for Journal in Brave)

zbMATH Keywords

DNFDeterministic automataExact learning

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Formal languages and automata (68Q45) Parallel algorithms in computer science (68W10)

Related Items (5)

Exact learning from an honest teacher that answers membership queries ⋮ Learning intersections and thresholds of halfspaces ⋮ Exact learning of DNF formulas using DNF hypotheses ⋮ An Algebraic Perspective on Boolean Function Learning ⋮ The query complexity of finding local minima in the lattice

Cites Work

• Learning regular sets from queries and counterexamples
• Queries and concept learning
• Inference of finite automata using homing sequences
• Learning Behaviors of Automata from Multiplicity and Equivalence Queries
• Unnamed Item
• Unnamed Item

This page was built for publication: A simple algorithm for learning O(log n)-term DNF