Characteristics of bottom-up parsable edNLC graph languages for syntactic pattern recognition

Further results of research into graph grammar-based parsing for syntactic pattern recognition (Pattern Recognition: 21, 623-629 (1988); 23, 765-774 (1990); 26, 1-16 (1993); 43, 2249-2264 (2010), Comput. Vision Graph. Image Process. 47, 1-21 (1989), Theoret. Comp. Sci. 201, 189-231 (1998)) are presented in the paper. The bottom-up parsable ETPR(k) subclass of well-known edNLC graph grammars is defined