Exponential time analysis of confluent and boundary eNCE graph languages

DOI10.1007/3-540-59071-4_47zbMath1528.68201OpenAlexW1605653887MaRDI QIDQ6184368

Egon Wanke, Konstantin Skodinis

Publication date: 5 January 2024

Published in: Graph-Theoretic Concepts in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-59071-4_47

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Grammars and rewriting systems (68Q42) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Hyperedge replacement: grammars and languages
• Boundary graph grammars with dynamic edge relabeling
• Graph-grammars and their application to computer science. 3rd International Workshop, Warrenton, Virginia, USA, December 2-6, 1986
• On the structure of node-label-controlled graph languages
• Restrictions, extensions, and variations of NLC grammars
• Graph grammars with neighbourhood-controlled embedding
• Algorithms for graph problems on BNLC structured garphs
• Graph grammars and their application to computer science. 4th international workshop, Bremen, Germany, March 5-9, 1990. Proceedings
• Graph-grammars and their application to computer science. 2nd International Workshop, Haus Ohrbeck, Germany, October 4-8, 1982. Under the auspices of the European Association for Theoretical Computer Science
• Handle-rewriting hypergraph grammars
• The monadic second-order logic of graphs. I: Recognizable sets of finite graphs
• Alternation
• Efficient decision procedures for graph properties on context-free graph languages

This page was built for publication: Exponential time analysis of confluent and boundary eNCE graph languages