scientific article; zbMATH DE number 4035178
From MaRDI portal
Publication:3774975
Recommendations
Cited in
(53)- Characteristics of graph languages generated by edge replacement
- An axiomatic definition of context-free rewriting and its application to NLC graph grammars
- Metatheorems for decision problems on hyperedge replacement graph languages
- The string generating power of context-free hypergraph grammars
- Context-free hypergraph grammars have the same term-generating power as attribute grammars
- 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
- A characterization of the sets of hypertrees generated by hyperedge-replacement graph grammars
- On hyperedge replacement and BNLC graph grammars
- Separating \(k\)-separated eNCE graph languages
- Hypergraph languages of bounded degree
- The translation power of top-down tree-to-graph transducers
- Context-free graph languages of bounded degree are generated by apex graph grammars
- Applications of a hyper-graph grammar system in adaptive finite-element computations
- A comparison of compatible, finite, and inductive graph properties
- Independent parallelism in finite copying parallel rewriting systems
- HRNCE grammars -- a hypergraph generating system with an eNCE way of rewriting
- Weighted parsing for grammar-based language models over multioperator monoids
- Finite-image property of weighted tree automata over past-finite monotonic strong bimonoids
- The complexity of graph languages generated by hyperedge replacement
- Handle-rewriting hypergraph grammars
- Constraint relaxation may be perfect
- scientific article; zbMATH DE number 5842462 (Why is no real title available?)
- Contextual Hypergraph Grammars – A New Approach to the Generation of Hypergraph Languages
- scientific article; zbMATH DE number 4035164 (Why is no real title available?)
- scientific article; zbMATH DE number 4062634 (Why is no real title available?)
- scientific article; zbMATH DE number 177418 (Why is no real title available?)
- scientific article; zbMATH DE number 177465 (Why is no real title available?)
- scientific article; zbMATH DE number 522836 (Why is no real title available?)
- scientific article; zbMATH DE number 2016076 (Why is no real title available?)
- HRNCE grammars — A hypergraph generating system with an eNCE way of rewriting
- scientific article; zbMATH DE number 219258 (Why is no real title available?)
- scientific article; zbMATH DE number 1361481 (Why is no real title available?)
- scientific article; zbMATH DE number 1836427 (Why is no real title available?)
- scientific article; zbMATH DE number 809155 (Why is no real title available?)
- Fusion grammars: a novel approach to the generation of graph languages
- Hyperedge replacement with rendezvous
- Set-theoretic graph rewriting
- A Greibach normal form for context-free graph grammars
- Separation results for separated apex NLC and NCE graph languages
- 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
- Closure properties of context-free hyperedge replacement systems
- Hyperedge replacement: grammars and languages
- On the regular structure of prefix rewriting
- Recognising k-connected hypergraphs in cubic time
- Recursively indefinite databases
- FO-query enumeration over SLP-compressed structures of bounded degree
- Modular tree transducers
- A comparison of boundary graph grammars and context-free hypergraph grammars
- Second-order abstract categorial grammars as hyperedge replacement grammars
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 Q3774975)
