scientific article; zbMATH DE number 4049101
context-freeerror distance between graphsgraph grammarsgraph parsershierarchical graph modelinexact graph matchingmembership problemparallel parsingprecedence relationssimilarity of graphssyntactic pattern recognition
Theory of compilers and interpreters (68N20) Theory of operating systems (68N25) Analysis of algorithms and problem complexity (68Q25) Formal languages and automata (68Q45) Semantics in the theory of computing (68Q55) Graph theory (including graph drawing) in computer science (68R10) Pattern recognition, speech recognition (68T10) Applications of graph theory to circuits and networks (94C15)
- Rule-based top-down parsing for acyclic contextual hyperedge replacement grammars
- The complexity of graph languages generated by hyperedge replacement
- Formalization and correctness of predictive shift-reduce parsers for graph grammars based on hyperedge replacement
- Predictive top-down parsing for hyperedge replacement grammars
- scientific article; zbMATH DE number 3845082 (Why is no real title available?)
- scientific article; zbMATH DE number 3902059 (Why is no real title available?)
- scientific article; zbMATH DE number 3943061 (Why is no real title available?)
- scientific article; zbMATH DE number 4043286 (Why is no real title available?)
- scientific article; zbMATH DE number 4049125 (Why is no real title available?)
- Hit ratios
- The bounded degree problem for non-obstructing eNCE graph grammars
- Graph automata for linear graph languages
- Exponential time analysis of confluent and boundary eNCE graph languages
- Nonterminal separation in graph grammars
- Boundary graph grammars with dynamic edge relabeling
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3785990)
