Learning DFA from simple examples

DOI10.1023/A:1010822518073MaRDI QIDQ5945680zbMATH OpenOpenAlexWikidataFDO

Authors Rajesh Parekh, Vasant Honavar

Publication date 11 September 2002

Published in Machine Learning (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1023/a:1010822518073

zbMATH Keywords

DFA inferenceefficient learning

Mathematics Subject Classification ID

Computational learning theory (68Q32)

Recommendations

• PAC learning with simple examples
• scientific article; zbMATH DE number 5957212
• Learning deterministic finite automata from smallest counterexamples
• scientific article; zbMATH DE number 1303603

Cited in

(10)

• Learning algorithms
• Learning from positive and negative examples: dichotomies and parameterized algorithms
• Minimal consistent DFA from sample strings
• Learning unary automata
• Learning Languages from Bounded Resources: The Case of the DFA and the Balls of Strings
• scientific article; zbMATH DE number 1303603 (Why is no real title available?)
• scientific article; zbMATH DE number 1104346 (Why is no real title available?)
• Polynomial characteristic sets for \(DFA\) identification
• scientific article; zbMATH DE number 2150298 (Why is no real title available?)
• Learning from positive and negative examples: new proof for binary alphabets

This page was built for publication: Learning DFA from simple examples

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5945680)