scientific article

zbMath0643.68108MaRDI QIDQ3785990

Manfred Kaul

Publication date: 1987

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

membership problemgraph grammarssyntactic pattern recognitionparallel parsinginexact graph matchingprecedence relationscontext-freehierarchical graph modelsimilarity of graphserror distance between graphsgraph parsers

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Formal languages and automata (68Q45) Graph theory (including graph drawing) in computer science (68R10) Pattern recognition, speech recognition (68T10) Theory of compilers and interpreters (68N20) Semantics in the theory of computing (68Q55) Applications of graph theory to circuits and networks (94C15) Theory of operating systems (68N25)

Related Items

Predictive Top-Down Parsing for Hyperedge Replacement Grammars, Formalization and correctness of predictive shift-reduce parsers for graph grammars based on hyperedge replacement, Exponential time analysis of confluent and boundary eNCE graph languages, Boundary graph grammars with dynamic edge relabeling, The bounded degree problem for non-obstructing eNCE graph grammars, Graph automata for linear graph languages, The complexity of graph languages generated by hyperedge replacement, Nonterminal separation in graph grammars, Rule-based top-down parsing for acyclic contextual hyperedge replacement grammars