Some new decision results for edge grammars

zbMATH Open1096.68648MaRDI QIDQ5485978FDOQ5485978

Authors: Ralf Stiebe 

Publication date: 6 September 2006

Recommendations

• Decision problems for edge grammars
• Representing graph families with edge grammars
• Metatheorems for decision problems on hyperedge replacement graph languages
• scientific article; zbMATH DE number 4087049
• The complexity of graph languages generated by hyperedge replacement

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Automata and formal grammars in connection with logical questions (03D05) Grammars and rewriting systems (68Q42) Graph theory (05C99) Undecidability and degrees of sets of sentences (03D35)

Cited In (2)

• Decision problems for edge grammars
• Selected Decision Problems for Square-Refinement Collage Grammars

This page was built for publication: Some new decision results for edge grammars

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