Universal automata and NFA learning
From MaRDI portal
Publication:954990
DOI10.1016/J.TCS.2008.05.017zbMATH Open1153.68030OpenAlexW2131211586MaRDI QIDQ954990FDOQ954990
Authors: B. E. Eshmatov 
Publication date: 18 November 2008
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2008.05.017
Recommendations
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Language identification in the limit
- Title not available (Why is that?)
- Complexity of automaton identification from given data
- Learning regular languages using RFSAs.
- Implementation and Application of Automata
- Grammatical Inference: Algorithms and Applications
- Unambiguous automata inference by means of state-merging methods.
- Title not available (Why is that?)
- Title not available (Why is that?)
- A Family of Algorithms for Non Deterministic Regular Languages Inference
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
- Title not available (Why is that?)
- Title not available (Why is that?)
- Polynomial characteristic sets for \(DFA\) identification
- CGE: a sequential learning algorithm for Mealy automata
- State-Merging DFA Induction Algorithms with Mandatory Merge Constraints
- On the Inference of Finite State Automata from Positive and Negative Data
- Polynomial inference of universal automata from membership and equivalence queries
- Learning automata teams
- On quotients of formal power series
- Parallel algorithms for minimal nondeterministic finite automata inference
- Learning algorithms
- 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)
