scientific article
From MaRDI portal
Publication:3774975
zbMath0635.68077MaRDI QIDQ3774975
Hans-Joerg Kreowski, Annegret Habel
Publication date: 1987
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Petri netsrewritingpumping lemmaflow diagramshypergraph languagesstring languagesHyperedge replacement systems
Hypergraphs (05C65) Formal languages and automata (68Q45) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) General topics in the theory of software (68N01)
Related Items (36)
Handle-rewriting hypergraph grammars ⋮ The translation power of top-down tree-to-graph transducers ⋮ Hyperedge replacement with rendezvous ⋮ Context-free graph languages of bounded degree are generated by apex graph grammars ⋮ Finite-image property of weighted tree automata over past-finite monotonic strong bimonoids ⋮ Constraint relaxation may be perfect ⋮ An axiomatic definition of context-free rewriting and its application to NLC graph grammars ⋮ Metatheorems for decision problems on hyperedge replacement graph languages ⋮ Set-theoretic graph rewriting ⋮ On systems of equations defining infinite graphs ⋮ Graph-theoretic properties compatible with graph derivations ⋮ The monadic second-order logic of graphs : Definable sets of finite graphs ⋮ A comparison of boundary graph grammars and context-free hypergraph grammars ⋮ Independent parallelism in finite copying parallel rewriting systems ⋮ HRNCE grammars -- a hypergraph generating system with an eNCE way of rewriting ⋮ The string generating power of context-free hypergraph grammars ⋮ HRNCE grammars — A hypergraph generating system with an eNCE way of rewriting ⋮ On the regular structure of prefix rewriting ⋮ Recognising \(k\)-connected hypergraphs in cubic time ⋮ Context-free hypergraph grammars have the same term-generating power as attribute grammars ⋮ Recursively indefinite databases ⋮ Second-order abstract categorial grammars as hyperedge replacement grammars ⋮ Separation results for separated apex NLC and NCE graph languages ⋮ The complexity of graph languages generated by hyperedge replacement ⋮ A Greibach normal form for context-free graph grammars ⋮ Applications of a hyper-graph grammar system in adaptive finite-element computations ⋮ Unnamed Item ⋮ Weighted parsing for grammar-based language models over multioperator monoids ⋮ A comparison of compatible, finite, and inductive graph properties ⋮ Trading independent for synchronized parallelism in finite copying parallel rewriting systems ⋮ The equivalence of bottom-up and top-down tree-to-graph transducers ⋮ The generating power of total deterministic tree transducers ⋮ On hyperedge replacement and BNLC graph grammars ⋮ Separating \(k\)-separated eNCE graph languages ⋮ Modular tree transducers ⋮ Hypergraph languages of bounded degree
This page was built for publication:
