INFERRING UNIONS OF TWO PATTERN LANGUAGES
Takeshi Shinohara · Bulletin of informatics and cybernetics · 1983
A pattern is a string of constant symbols and variable symbols. The language $ L(p) $ of a pattern $ p $ is the set of all strings obtained by substituting any non-empty constant string for each variable symbol in $ p $. In this paper we consider inference from positive data for unions of two pattern languages, that is, identification of $ L(p) smile L(q) $ when an enumeration of elements in the union is given.