The bounded tree-width problem of context-free graph languages

DOI10.1007/BFB0024506MaRDI QIDQ4373689zbMATH OpenFDO

Authors Konstantin Skodinis

Publication date 23 June 1998

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/BFB0024506

zbMATH Keywords

graph grammars

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

Recommendations

• The bounded degree problem for eNCE graph grammars
• The complexity of the \(K_{n,n}\)-problem for node replacement graph languages
• scientific article; zbMATH DE number 4060748
• The complexity of connectivity problems on context-free graph languages

Cited in

(10)

• The ancestor width of grammars and languages
• The complexity of connectivity problems on context-free graph languages
• The bounded degree problem for eNCE graph grammars
• The complexity of the \(K_{n,n}\)-problem for node replacement graph languages
• Emptiness problems of eNCE graph languages
• Complexity of uniform membership of context-free tree grammars
• scientific article; zbMATH DE number 17563 (Why is no real title available?)
• The bounded degree problem for non-obstructing eNCE graph grammars
• NCE graph grammars and clique-width.
• On parse trees and Myhill-Nerode-type tools for handling graphs of bounded rank-width

This page was built for publication: The bounded tree-width problem of context-free graph languages

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4373689)