Learning Regular Languages Using Nondeterministic Finite Automata
From MaRDI portal
Publication:3602804
DOI10.1007/978-3-540-70844-5_10zbMATH Open1172.68508OpenAlexW1604149093MaRDI QIDQ3602804FDOQ3602804
Author name not available (Why is that?)
Publication date: 12 February 2009
Published in: Implementation and Applications of Automata (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-70844-5_10
Recommendations
Cited In (21)
- Grammatical Inference: Algorithms and Applications
- Learning infinite-word automata with loop-index queries
- Title not available (Why is that?)
- Identification of automata by sequential learning
- Grammatical Inference: Algorithms and Applications
- Algorithms for learning regular expressions from positive data
- Title not available (Why is that?)
- Title not available (Why is that?)
- Universal automata and NFA learning
- Parallel Algorithms for Minimal Nondeterministic Finite Automata Inference
- Title not available (Why is that?)
- Demonstrating Learning of Register Automata
- Inference of regular languages using state merging algorithms with search
- Learning Commutative Regular Languages
- Learning algorithms
- Learning Symbolic Automata
- Title not available (Why is that?)
- Inference of deterministic one-counter languages
- Learning regular languages from counterexamples
- Title not available (Why is that?)
- A Family of Algorithms for Non Deterministic Regular Languages Inference
This page was built for publication: Learning Regular Languages Using Nondeterministic Finite Automata
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3602804)
