The query complexity of learning DFA
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3664335 (Why is no real title available?)
- scientific article; zbMATH DE number 177810 (Why is no real title available?)
- scientific article; zbMATH DE number 1418473 (Why is no real title available?)
- A framework for polynomial-time query learnability
- A theory of the learnable
- Asking questions to minimize errors
- Cryptographic limitations on learning Boolean formulae and finite automata
- Language identification in the limit
- Learning regular sets from queries and counterexamples
- Prediction-preserving reducibility
- When won't membership queries help?
Cited in
(8)- New bounds for the query complexity of an algorithm that learns DFAs with correction and equivalence queries
- scientific article; zbMATH DE number 1418473 (Why is no real title available?)
- Learning deterministic finite automata from smallest counterexamples
- Types of trusted information that make DFA identification with correction queries feasible
- Learning fallible deterministic finite automata
- The complexity of learning SUBSEQ(A)
- scientific article; zbMATH DE number 5957322 (Why is no real title available?)
- Even linear simple matrix languages: formal language properties and grammatical inference.
This page was built for publication: The query complexity of learning DFA
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1336037)
