scientific article; zbMATH DE number 3852433

MaRDI QIDQ3321473zbMATH OpenFDO

Authors Franz J. Brandenburg

Publication date 1983

zbMATH Keywords

complexity of the membership problem of classes of graph grammarslabelled graphs

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Formal languages and automata (68Q45)

Recommendations

• scientific article; zbMATH DE number 3885330
• scientific article; zbMATH DE number 4051027
• scientific article; zbMATH DE number 3872712
• Linear graph grammars: Power and complexity
• The complexity of graph languages generated by hyperedge replacement

Cited in

(21)

• On the membership problem for regular DNLC grammars
• Graph theoretic closure properties of the family of boundary NLC graph languages
• Combinatorial properties of boundary NLC graph languages
• String grammars with disconnecting or a basic root of the difficulty in graph grammar parsing
• Power properties of NLC graph grammars with a polynomial membership problem
• Complexity of decision problems on totally rigid acyclic tree grammars
• A reformulation of matrix graph grammars with Boolean complexes
• Complexity of uniform membership of context-free tree grammars
• The complexity of membership for deterministic growing context-sensitive grammars^∗
• scientific article; zbMATH DE number 3885330 (Why is no real title available?)
• scientific article; zbMATH DE number 3888930 (Why is no real title available?)
• scientific article; zbMATH DE number 4010474 (Why is no real title available?)
• scientific article; zbMATH DE number 4041319 (Why is no real title available?)
• scientific article; zbMATH DE number 4051027 (Why is no real title available?)
• scientific article; zbMATH DE number 17563 (Why is no real title available?)
• The bounded degree problem for non-obstructing eNCE graph grammars
• scientific article; zbMATH DE number 1372648 (Why is no real title available?)
• scientific article; zbMATH DE number 3999291 (Why is no real title available?)
• The membership problem for unordered vector languages
• A polynomial algorithm for the membership problem with categorial grammars
• Fundamental methodological issues of syntactic pattern recognition

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 Q3321473)