Learning deterministic automata on infinite words
From MaRDI portal
Recommendations
- On the learnability of infinitary regular sets
- A novel learning algorithm for Büchi automata based on family of DFAs and classification trees
- Learning regular omega languages
- Learning regular omega languages
- A novel learning algorithm for Büchi automata based on family of DFAs and classification trees
Cited in
(15)- Efficient learning of typical finite automata from random walks
- Inference of -languages from prefixes.
- On the learnability of infinitary regular sets
- A novel learning algorithm for Büchi automata based on family of DFAs and classification trees
- Learning infinite-word automata with loop-index queries
- Learning weighted automata over principal ideal domains
- A novel learning algorithm for Büchi automata based on family of DFAs and classification trees
- Approximate learning of limit-average automata
- Constructing deterministic -automata from examples by an extension of the RPNI algorithm
- Learning realtime one-counter automata
- Learning deterministic variable automata over infinite alphabets
- Passive learning of deterministic Büchi automata by combinations of DFAs
- Constructing deterministic parity automata from positive and negative examples
- Active learning for sound negotiations
- Constructing concise characteristic samples for acceptors of omega regular languages
This page was built for publication: Learning deterministic automata on infinite words
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4999312)
