Learning nominal automata
From MaRDI portal
Abstract: We present an Angluin-style algorithm to learn nominal automata, which are acceptors of languages over infinite (structured) alphabets. The abstract approach we take allows us to seamlessly extend known variations of the algorithm to this new setting. In particular we can learn a subclass of nominal non-deterministic automata. An implementation using a recently developed Haskell library for nominal computation is provided for preliminary experiments.
Recommendations
Cited in
(40)- A novel learning algorithm for Büchi automata based on family of DFAs and classification trees
- A categorical framework for learning generalised tree automata
- Learning infinite-word automata with loop-index queries
- Learning weighted automata over principal ideal domains
- Learning pomset automata
- Completeness and incompleteness in nominal Kleene algebra
- A (co)algebraic theory of succinct automata
- Automata theory in nominal sets
- Nominal automata for resource usage control
- Nominal automata with name binding
- Learning symbolic automata
- Polynomial-time equivalence testing for deterministic fresh-register automata
- Residuality and learning for nondeterministic nominal automata
- scientific article; zbMATH DE number 7559500 (Why is no real title available?)
- A Kleene theorem for nominal automata
- CALF: categorical automata learning framework
- A generic algorithm for learning symbolic automata from membership queries
- Approximate learning of limit-average automata
- Completeness of Nominal PROPs
- Fast computations on ordered nominal sets
- Fast computations on ordered nominal sets
- A Myhill-Nerode theorem for register automata and symbolic trace languages
- Active learning for deterministic bottom-up nominal tree automata
- On-the-fly bisimilarity checking for fresh-register automata
- Compositional automata learning of synchronous systems
- A new approach for active automata learning based on apartness
- Learning deterministic variable automata over infinite alphabets
- Active learning for sound negotiations
- Automata and grammars for data words
- Guarded Kleene algebra with tests: automata learning
- Learning automata and transducers: a categorical approach
- What you must remember when transforming datawords
- Passive learning of regular data languages in polynomial time and data
- Complete test suites for automata in monoidal closed categories
- Variable automata over infinite alphabets
- Feasability of learning weighted automata on a semiring
- Register automata with permutations
- Learning bottom-up tree automata valued in monoidal categories
- \(SL^{\lambda}\): a scalable algorithm for register automata learning
- Active learning of symbolic mealy automata
This page was built for publication: Learning nominal automata
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5370894)
