Recommendations
Cites work
- scientific article; zbMATH DE number 5605075 (Why is no real title available?)
- scientific article; zbMATH DE number 3664335 (Why is no real title available?)
- scientific article; zbMATH DE number 58314 (Why is no real title available?)
- scientific article; zbMATH DE number 2019593 (Why is no real title available?)
- scientific article; zbMATH DE number 3366846 (Why is no real title available?)
- A Family of Algorithms for Non Deterministic Regular Languages Inference
- Complexity of automaton identification from given data
- Grammatical Inference: Algorithms and Applications
- Implementation and Application of Automata
- Language identification in the limit
- Learning regular languages using RFSAs.
- Unambiguous automata inference by means of state-merging methods.
Cited in
(17)- Learning language intersections
- Learning Regular Languages Using Nondeterministic Finite Automata
- MAT learning of universal automata
- The universal fuzzy automaton
- Learning nominal automata
- scientific article; zbMATH DE number 2089448 (Why is no real title available?)
- scientific article; zbMATH DE number 1670717 (Why is no real title available?)
- Polynomial characteristic sets for \(DFA\) identification
- CGE: a sequential learning algorithm for Mealy automata
- State-Merging DFA Induction Algorithms with Mandatory Merge Constraints
- Polynomial inference of universal automata from membership and equivalence queries
- On the Inference of Finite State Automata from Positive and Negative Data
- Learning automata teams
- On quotients of formal power series
- Learning algorithms
- Parallel algorithms for minimal nondeterministic finite automata inference
- A Family of Algorithms for Non Deterministic Regular Languages Inference
This page was built for publication: Universal automata and NFA learning
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q954990)
