MAT learning of universal automata

DOI10.1007/978-3-642-37064-9_14MaRDI QIDQ4910453zbMATH OpenOpenAlexFDO

Authors Johanna Björklund, Henning Fernau, Anna Kasprzik

Publication date 18 March 2013

Published in Language and Automata Theory and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-37064-9_14

zbMATH Keywords

observation tablesquery learninguniversal automata

Mathematics Subject Classification ID

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

Recommendations

• Polynomial inference of universal automata from membership and equivalence queries
• Universal automata and NFA learning
• scientific article; zbMATH DE number 5854939
• MAT learners for tree series: an abstract data type and two realizations
• Query learning of regular tree languages: How to avoid dead states

Cited in

(4)

• Learning language intersections
• Unsupervised automata learning via discrete optimization
• MAT learners for tree series: an abstract data type and two realizations
• Universal automata and NFA learning

This page was built for publication: MAT learning of universal automata

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