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â€¦ (More)

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â€¦ (More)

We present a generic algorithmic scheme for learning languages defined over large or infinite alphabets such as bounded subsets of N and R, or Boolean vectors of high dimension. These languages areâ€¦ (More)

Learning regular languages is a branch of machine learning, a domain which has proved useful in many areas, including artificial intelligence, neural networks, data mining, verification, etc. Inâ€¦ (More)