PATH-CONTROLLED GRAPH GRAMMARS FOR SYNTACTIC PATTERN RECOGNITION

The graph structure is a strong formalism for representing pictures in syntactic pattern recognition. Many models for graph grammars have been proposed as a kind of hyper-dimensional generating systems, whereas the use of such grammars for pattern recognition is relatively infrequent. One of the reasons is the difficulty of building a syntax analyzer for such graph grammars. In this paper, we define a subclass of nPCE graph grammars and present a parsing algorithm of O(n) for both sequential and parallel cases.