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

DOI10.1007/978-3-642-18098-9_29zbMATH Open1297.68099OpenAlexW2226936361MaRDI QIDQ3073646FDOQ3073646

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

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

zbMATH Keywords

deterministic finite automatoncorrection queryinjectivity degree

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Learning regular sets from queries and counterexamples
• Language identification in the limit
• Teaching a smarter learner.
• Complexity of automaton identification from given data
• On the complexity of minimum inference of regular sets
• A note on the number of queries needed to identify regular languages
• Learning DFA from Correction and Equivalence Queries

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)