Learning finite automata using label queries
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3427224 (Why is no real title available?)
- scientific article; zbMATH DE number 2068873 (Why is no real title available?)
- A note on the number of queries needed to identify regular languages
- Efficient learning of typical finite automata from random walks
- Learning DFA from Correction and Equivalence Queries
Cited in
(4)
This page was built for publication: Learning finite automata using label queries
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3648751)