A Bottom-Up Efficient Algorithm Learning Substitutable Languages from Positive Examples

Based on Harris’s substitutability criterion, the recent denitions of classes of substitutable languages have led to interesting polynomial learnability results for expressive formal languages. These classes are also promising for practical applications: in natural language analysis, because denitions have strong linguisitic support, but also in biology for modeling protein families, as suggested in our previous study introducing the class of local substitutable languages. But turning recent theoretical advances into practice badly needs truly practical algorithms. We present here an ecient