Deterministic graph grammars

MaRDI QIDQ3086923zbMATH OpenFDO

Authors Didier Caucal

Publication date 30 March 2011

zbMATH Keywords

context-free graph grammarsdeterministic context-free languageshyperedge replacement grammarspushdown automata

Mathematics Subject Classification ID

Research exposition (monographs, survey articles) pertaining to computer science (68-02) Grammars and rewriting systems (68Q42)

Recommendations

• scientific article; zbMATH DE number 522845
• Regular description of context-free graph languages
• scientific article; zbMATH DE number 17539
• Hyperedge replacement: grammars and languages
• scientific article; zbMATH DE number 125883

Cited in

(10)

• Computation graphs for actor grammars
• Interactive graph grammar
• Diagnosis and opacity problems for infinite state systems modeled by recursive tile systems
• Adversarial topology discovery in network virtualization environments: a threat for ISPs?
• Synchronization of Regular Automata
• scientific article; zbMATH DE number 1089086 (Why is no real title available?)
• scientific article; zbMATH DE number 1836407 (Why is no real title available?)
• scientific article; zbMATH DE number 919847 (Why is no real title available?)
• Path Algorithms on Regular Graphs
• The power of programmed grammars with graphs from various classes

This page was built for publication: Deterministic graph grammars

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