scientific article; zbMATH DE number 4049105

From MaRDI portal
Publication:3785994





[For the entire collection see Zbl 0636.00013.] Apex graph grammars are NLC-like graph grammars with the restriction that embedding edges are established between terminal nodes only. Some basic theoretical properties of these grammars are investigated.











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