Pattern languages with and without erasing

Abstract

The paper deals with the problems related to finding a pattern common to all words in a given set. We restrict our attention to patterns expressible by the use of variables ranging over words. Two essentially different cases result, depending on whether or not the empty word belongs to the range. We investigate equivalence and inclusion problems, patterns descriptive for a set, as well as some complexity issues. The inclusion problem between two pattern languages turns out to be of fundamental theoretical importance because many problems in the classical combinatorics of words can be reduced to it.

Keywords:

• Pattern of words
• descriptive patterns
• formal languages
• inductive inference
• learning

C.R Categories:

• F4.2
• F4.3