Partition-refining algorithms for learning finite state automata
From MaRDI portal
Recommendations
- Learning Regular Languages Using Nondeterministic Finite Automata
- Universal automata and NFA learning
- Inference of Residual Finite-State Tree Automata from Membership Queries and Finite Positive Data
- Query learning of regular tree languages: How to avoid dead states
- scientific article; zbMATH DE number 1008506
This page was built for publication: Partition-refining algorithms for learning finite state automata
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3046847)