scientific article
From MaRDI portal
Publication:3714485
zbMath0587.68076MaRDI QIDQ3714485
Publication date: 1985
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
data structuresdecidabilityPetri-netsgraph languagesprecedence relationsconfluent graph grammarscontext-free graph grammarsbracket mountainscontrol flow model for PROLOG-programsimplementation with adjacency listsPascal-programsprecedence graph grammarsprecedence parsers for graphsseries-parallel-networkswell-structured flowgraphs
Formal languages and automata (68Q45) Graph theory (including graph drawing) in computer science (68R10) Theory of compilers and interpreters (68N20)
Related Items (16)
Handle-rewriting hypergraph grammars ⋮ Graph traversal and graph transformation ⋮ An axiomatic definition of context-free rewriting and its application to NLC graph grammars ⋮ Complexity of boundary graph languages ⋮ Logical description of context-free graph languages ⋮ Exponential time analysis of confluent and boundary eNCE graph languages ⋮ Boundary graph grammars with dynamic edge relabeling ⋮ A comparison of boundary graph grammars and context-free hypergraph grammars ⋮ Adaptive Star Grammars for Graph Models ⋮ Order independent NCE grammars recognized in polynomial time ⋮ The bounded degree problem for non-obstructing eNCE graph grammars ⋮ Node replacement in hypergraphs: Simulation of hyperedge replacement, and decidability of confluence ⋮ Linear graph grammars: Power and complexity ⋮ The complexity of the \(K_{n,n}\)-problem for node replacement graph languages ⋮ Nonterminal separation in graph grammars ⋮ Hypergraph languages of bounded degree
This page was built for publication:
