Learning unary automata

DOI10.25596/JALC-2007-147MaRDI QIDQ3517101zbMATH OpenFDO

Authors Gregor Gramlich, Ralf Herrmann

Publication date 12 August 2008

Full work available at URL https://doi.org/10.25596/JALC-2007-147

zbMATH Keywords

computational learning theorylearning complexity

Mathematics Subject Classification ID

Computational learning theory (68Q32) Formal languages and automata (68Q45)

Recommendations

• Learning deterministic finite automata from smallest counterexamples
• Learning DFA from simple examples
• Mathematical Foundations of Computer Science 2003
• scientific article; zbMATH DE number 1303603
• Learning regular sets from queries and counterexamples

Cited in

(5)

• Learning deterministic finite automata from smallest counterexamples
• scientific article; zbMATH DE number 1301788 (Why is no real title available?)
• scientific article; zbMATH DE number 1303603 (Why is no real title available?)
• scientific article; zbMATH DE number 1351099 (Why is no real title available?)
• Learning from positive and negative examples: new proof for binary alphabets

This page was built for publication: Learning unary automata

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