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 the set of natural numbers. © 2014 Springer-Verlag.
Cite
CITATION STYLE
Maler, O., & Mens, I. E. (2014). Learning regular languages over large alphabets. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8413 LNCS, pp. 485–499). Springer Verlag. https://doi.org/10.1007/978-3-642-54862-8_41
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
