Finite automata and unions of regular patterns with bounded constant segments

Abstract

The class of unbounded unions of regular pattern languages with bounded constant segments is identifiable from positive data in the limit [1]. Otherwise, no efficient algorithm that performs the inference of this class of languages is known. We propose a solution to this problem using the existing connexion between the positive variety of languages of dot depth 1/2, ℒJ+ [2] and the class of unbounded union of pattern languages RP+ℒ. © Springer-Verlag Berlin Heidelberg 2006.