A Family of Algorithms for Non Deterministic Regular Languages Inference
From MaRDI portal
Recommendations
- Learning Regular Languages Using Nondeterministic Finite Automata
- Universal automata and NFA learning
- Parallel algorithms for minimal nondeterministic finite automata inference
- On the Inference of Finite State Automata from Positive and Negative Data
- Grammatical Inference: Algorithms and Applications
Cited in
(9)- Learning algorithms
- A comparative study of two algorithms for automata identification
- Learning Regular Languages Using Nondeterministic Finite Automata
- Inferring subclasses of regular languages faster using RPNI and forbidden configurations
- Parallel algorithms for minimal nondeterministic finite automata inference
- Grammatical Inference: Algorithms and Applications
- Unambiguous automata inference by means of state-merging methods.
- Inference of deterministic one-counter languages
- Universal automata and NFA learning
This page was built for publication: A Family of Algorithms for Non Deterministic Regular Languages Inference
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5757244)