Oded Maler

Learning Regular Languages over Large Ordered Alphabets

2015 · Logical Methods in Computer Science

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 …