scientific article; zbMATH DE number 3885330
From MaRDI portal
Publication:3219131
Recommendations
Cited in
(34)- On the membership problem for regular DNLC grammars
- Combinatorial properties of boundary NLC graph languages
- String grammars with disconnecting or a basic root of the difficulty in graph grammar parsing
- Graph-grammars and their application to computer science. 3rd International Workshop, Warrenton, Virginia, USA, December 2-6, 1986
- Power properties of NLC graph grammars with a polynomial membership problem
- Computation graphs for actor grammars
- Linear graph grammars: Power and complexity
- HRNCE grammars -- a hypergraph generating system with an eNCE way of rewriting
- Complexity of two-dimensional rank-reducing grammars
- Non-perturbative graph languages, halting problem and complexity
- The complexity of graph languages generated by hyperedge replacement
- A reformulation of matrix graph grammars with Boolean complexes
- Characterizing compressibility of disjoint subgraphs with NLC grammars
- scientific article; zbMATH DE number 3888930 (Why is no real title available?)
- scientific article; zbMATH DE number 3852433 (Why is no real title available?)
- scientific article; zbMATH DE number 3872712 (Why is no real title available?)
- Solving Coverage Problems with Embedded Graph Grammars
- scientific article; zbMATH DE number 3909759 (Why is no real title available?)
- Boundary NLC graph grammars—Basic definitions, normal forms, and complexity
- scientific article; zbMATH DE number 4049100 (Why is no real title available?)
- scientific article; zbMATH DE number 4051027 (Why is no real title available?)
- scientific article; zbMATH DE number 4060748 (Why is no real title available?)
- GIGs: Restricted context-sensitive descriptive power in bounded polynomial-time
- On the structure of linear apex NLC graph grammars
- scientific article; zbMATH DE number 1539544 (Why is no real title available?)
- The bounded degree problem for non-obstructing eNCE graph grammars
- HRNCE grammars — A hypergraph generating system with an eNCE way of rewriting
- scientific article; zbMATH DE number 3999291 (Why is no real title available?)
- The bounded degree problem for NLC grammars is decidable
- Parallel algorithms for a class of graphs generated recursively
- Algorithmic uses of the Feferman-Vaught theorem
- The power of programmed grammars with graphs from various classes
- The complexity of regular DNLC graph languages
- A comparison of boundary graph grammars and context-free hypergraph 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 Q3219131)