Parsing of edNLC-graph grammars for scene analysis

DOI10.1016/0031-3203(88)90034-9zbMath0662.68083OpenAlexW2070848011MaRDI QIDQ1114425

Mariusz Flasiński

Publication date: 1988

Published in: Pattern Recognition (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0031-3203(88)90034-9

zbMATH Keywords

syntactic pattern recognitionNLC grammarsparsing algorithmEDG-graphedNLC-graph grammar

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Theory of compilers and interpreters (68N20) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items (2)

Power properties of NLC graph grammars with a polynomial membership problem ⋮ Fundamental methodological issues of syntactic pattern recognition

Cites Work

• Unnamed Item
• Unnamed Item
• On the structure of node-label-controlled graph languages
• Parsing and Translation of (Attributed) Expansive Graph Languages for Scene Analysis
• On sequential and parallel node-rewriting graph grammars

This page was built for publication: Parsing of edNLC-graph grammars for scene analysis