Abstract
The problem of developing an appropriate data base for syntax-directed pattern analysis and recognition is considered. A new data base is introduced by generalizing the notion of concatenation in representing patterns with a relationship matrix. The characteristics of relationship matrix are demonstrated in teh context of formal language theory. It is shown that this data base will allow us to remove many of the present restrictions placed on the types of patterns that can be handled by syntax-directed systems. Problems in pattern analysis (description and generation) as well as in pattern recognition are discussed and examples are given to illustrate the potential application of this data base in both of these areas.

This publication has 8 references indexed in Scilit: