Learning DFA from Correction and Equivalence Queries
From MaRDI portal
Recommendations
- A Note on the Relationship between Different Types of Correction Queries
- New bounds for the query complexity of an algorithm that learns DFAs with correction and equivalence queries
- Correction queries in active learning
- On Learning Regular Expressions and Patterns Via Membership and Correction Queries
- A Characterization of the Language Classes Learnable with Correction Queries
Cited in
(13)- One-shot learners using negative counterexamples and nearest positive examples
- Necessary and sufficient conditions for learning with correction queries
- Correction queries in active learning
- Types of trusted information that make DFA identification with correction queries feasible
- Learning balls of strings from edit corrections
- One-Shot Learners Using Negative Counterexamples and Nearest Positive Examples
- Polynomial Time Algorithms for Learning k-Reversible Languages and Pattern Languages with Correction Queries
- On Learning Regular Expressions and Patterns Via Membership and Correction Queries
- A Note on the Relationship between Different Types of Correction Queries
- Learning finite automata using label queries
- Learning definite Horn formulas from closure queries
- A Characterization of the Language Classes Learnable with Correction Queries
- New bounds for the query complexity of an algorithm that learns DFAs with correction and equivalence queries
This page was built for publication: Learning DFA from Correction and Equivalence Queries
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3541870)