Gaetano Pellegrino

Learning Deterministic Finite Automata from Infinite Alphabets

2016 · Open Repository and Bibliography (University of Luxembourg)

We proposes an algorithm to learn automata infinite alphabets, or at least too large to enumerate. We apply it to define a generic model intended for regression, with transitions constrained by intervals over the alphabet. …