A research into a syntactic pattern recognition model based on
(edNLC) graph grammars (introduced and investigated in Janssens and Rozenberg
Inform. Sci. 20 (1980), 191-216, and Janssens, Rozenberg and Verraedt Comp.
Vis. Graph. Image Process. 18 (1982), 279-304) has resulted in defining the
efficient, O(n
^2
), parsing schemes for the ETPL(k) subclass of these grammars
and applying it for scene analysis, CAD/CAMobject analysis and constructingAI
systems (Flasiński Patt. Recogn. 21 (1988), 623-629, Flasiński Comp. Vis.
Graph. Image Process. 47 (1989), 1-21, Flasiński Patt. Recogn. 26 (1993),
1-16, Flasiński Comp. Aided-Des. 27 (1995), 403-433, Flasiński Theor. Comp.
Sci. 201 (1998), 189-231). In the paper the grammatical inference method for
the parsable ETPL(k) graph grammars is defined, completing the development of
this syntactic pattern recognition model.
