- Tytuł:
- Generative power of reduction-based parsable ETPR(k) graph grammars for syntactic pattern recognition
- Autorzy:
- Flasiński, M.
- Powiązania:
- https://bibliotekanauki.pl/articles/385088.pdf
- Data publikacji:
- 2018
- Wydawca:
- Sieć Badawcza Łukasiewicz - Przemysłowy Instytut Automatyki i Pomiarów
- Tematy:
-
syntactic pattern recognition
graph grammar
parsing
rozpoznawanie wzoru syntaktycznego
gramatyka grafowa - Opis:
- 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), Comput. 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 of CF - LL(k) - LR(k) string languages and the triad of NLC - ETPL(k) - ETPR(k) graph languages is discussed.
- Źródło:
-
Journal of Automation Mobile Robotics and Intelligent Systems; 2018, 12, 2; 61-81
1897-8649
2080-2145 - Pojawia się w:
- Journal of Automation Mobile Robotics and Intelligent Systems
- Dostawca treści:
- Biblioteka Nauki
Artykuł