Learning regular languages using non deterministic finite automata
From MaRDI portal
Recommendations
Cited in
(20)- On locally reversible languages
- Learning regular languages from counterexamples
- Learning regular languages using RFSAs.
- Learning infinite-word automata with loop-index queries
- Residual finite state automata
- Demonstrating Learning of Register Automata
- On the Inference of Finite State Automata from Positive and Negative Data
- Learning Regular Languages Using Nondeterministic Finite Automata
- scientific article; zbMATH DE number 2080668 (Why is no real title available?)
- scientific article; zbMATH DE number 2080921 (Why is no real title available?)
- Active learning of nondeterministic finite state machines
- \textsc{PAutomaC}: a probabilistic automata and hidden Markov models learning competition
- Improving active Mealy machine learning for protocol conformance testing
- Learning residual finite-state automata using observation tables
- Query learning algorithm for residual symbolic finite automata
- Residuality and learning for nondeterministic nominal automata
- scientific article; zbMATH DE number 7559411 (Why is no real title available?)
- Implementation and Application of Automata
- Universal automata and NFA learning
- On the efficient construction of quasi-reversible automata for reversible languages
This page was built for publication: Learning regular languages using non deterministic finite automata
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2754000)
