Learning regular languages over large ordered alphabets
From MaRDI portal
Abstract: This work is concerned with regular languages defined over large alphabets, either infinite or just too large to be expressed enumeratively. We define a generic model where transitions are labeled by elements of a finite partition of the alphabet. We then extend Angluin's L* algorithm for learning regular languages from examples for such automata. We have implemented this algorithm and we demonstrate its behavior where the alphabet is a subset of the natural or real numbers. We sketch the extension of the algorithm to a class of languages over partially ordered alphabets.
Recommendations
Cited in
(14)- Regular \(\omega\)-languages with an informative right congruence
- On the regularity and learnability of ordered DAG languages
- Insights to Angluin's learning
- Learning symbolic automata
- scientific article; zbMATH DE number 7447748 (Why is no real title available?)
- scientific article; zbMATH DE number 2080921 (Why is no real title available?)
- Query learning algorithm for residual symbolic finite automata
- Learning one-clock timed automata
- Learning with partially ordered representations
- A generic algorithm for learning symbolic automata from membership queries
- Enhancing active model learning with equivalence checking using simulation relations
- Timed automata verification and synthesis via finite automata learning
- Active learning of symbolic Mealy automata
- Active learning of symbolic mealy automata
This page was built for publication: Learning regular languages over large ordered alphabets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3196344)
