Types of trusted information that make DFA identification with correction queries feasible

DOI10.1007/978-3-642-18098-9_29MaRDI QIDQ3073646zbMATH OpenOpenAlexFDO

Authors Cristina Tîrnăucă, Cătălin Ionuţ Tîrnăucă

Publication date 11 February 2011

Published in Implementation and Application of Automata (Search for Journal in Brave)

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

zbMATH Keywords

deterministic finite automatoncorrection queryinjectivity degree

Mathematics Subject Classification ID

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

Recommendations

• Learning DFA from Correction and Equivalence Queries
• New bounds for the query complexity of an algorithm that learns DFAs with correction and equivalence queries
• The query complexity of learning DFA
• Correction queries in active learning
• Necessary and sufficient conditions for learning with correction queries

Cites work

• scientific article; zbMATH DE number 3664335 (Why is no real title available?)
• A note on the number of queries needed to identify regular languages
• Complexity of automaton identification from given data
• Language identification in the limit
• Learning DFA from Correction and Equivalence Queries
• Learning regular sets from queries and counterexamples
• On the complexity of minimum inference of regular sets
• Teaching a smarter learner.

This page was built for publication: Types of trusted information that make DFA identification with correction queries feasible

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