Parsing of edNLC-graph grammars for scene analysis
Pattern Recognition
Characteristics of edNLC-graph grammar for syntactic pattern recognition
Computer Vision, Graphics, and Image Processing
A new parsing scheme for plex grammars
Pattern Recognition
Inference of tree grammars using negative samples
Pattern Recognition
Power properties of NLC graph grammars with a polynomial membership problem
Theoretical Computer Science
Stochastic Inference of Regular Tree Languages
Machine Learning
Efficient Algorithms on Context-Free Graph Grammars
ICALP '88 Proceedings of the 15th International Colloquium on Automata, Languages and Programming
Optimal Stochastic Scaling for CAE Parallel Computations
RSCTC '98 Proceedings of the First International Conference on Rough Sets and Current Trends in Computing
Parsing of graphs in linear time
Proceedings of the 2nd International Workshop on Graph-Grammars and Their Application to Computer Science
Graph grammars with node-label controlled rewriting and embedding
Proceedings of the 2nd International Workshop on Graph-Grammars and Their Application to Computer Science
A Parser for Context Free Plex Grammars
WG '89 Proceedings of the 15th International Workshop on Graph-Theoretic Concepts in Computer Science
Automata-Based Multi-agent Model as a Tool for Constructing Real-Time Intelligent Control Systems
CEEMAS '01 Revised Papers from the Second International Workshop of Central and Eastern Europe on Multi-Agent Systems: From Theory to Practice in Multi-Agent Systems
On the analysis of fuzzy string patterns with the help of extended and stochastic GDPLL(k) grammars
Fundamenta Informaticae - Special issue on theory and applications of soft computing (TASC04)
IJCAI'69 Proceedings of the 1st international joint conference on Artificial intelligence
Automata on a 2-dimensional tape
FOCS '67 Proceedings of the 8th Annual Symposium on Switching and Automata Theory (SWAT 1967)
Parsing and Translation of (Attributed) Expansive Graph Languages for Scene Analysis
IEEE Transactions on Pattern Analysis and Machine Intelligence
The Use of Tree Derivatives and a Sample Support Parameter for Inferring Tree Systems
IEEE Transactions on Pattern Analysis and Machine Intelligence
| Hi-index | 0.00 |
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.