Journal of Automation, Mobile Robotics & Intelligent Systems. 2018, Vol. 12 Issue 2, p61-81. 21p.
GRAPH grammars and PATTERN perception
Further results of research into parsable graph grammars used for syntactic pattern recognition (Pattern Recognition: 21, 623-629 (1988); 23, 765-774 (1990); 24, 12-23 (1991); 26, 1-16 (1993); 43, 2249-2264 (2010), Com put. Vision Graph. Image Process. 47, 1-21 (1989), Computer-Aided Design 27, 403-433 (1995), Theoret. Comp. Sci. 201, 189-231 (1998), Pattern Analysis Applications bf 17, 465-480 (2014)) are presented in the paper. The generative power of reduction-based parsable ETPR(k) graph grammars is investigated. The analogy between the triad ofCF- LL(k) - LR(k) string languages and the triad ofNLC - ETPL(k) - ETPR(k) graph languages is discussed. [ABSTRACT FROM AUTHOR]
Flasiński,, Mariusz, Flasiński,, Piotr, and Konduracka, Ewa
Proceedings of the 8th International Conference on Computer Recognition Systems CORES 2013. 2013, p591-599.
On the Use of Programmed Automata for a Verification of ECG Diagnoses The recent results into constructing a formal model of a syntactic pattern recognition-based System for Teaching ElectroCardioGraphy (STECG) [...]