Abstract
It is shown that up to vertex labelling BNLC grammars of bounded nonterminal degree generate the same languages of simple graphs as hyperedge replacement grammars. This does not hold if the vertex labelling is taken into account. Vice versa hyperedge replacement grammars generate the same languages of simple graphs as BNLC grammars of bounded nonterminal degree. Furthermore the generation of loops and multiple edges by hyperedege replacement grammars is discussed.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have