Tools for dynamic network structures: GRAPE grammars

A theoretical framework based on attributed elementary programmed graph grammars (GRAPE grammars) that turns out to be equally well-suited for describing network dynamics, weight learning algorithms, and topology learning algorithms is proposed. It is shown how GRAPE grammars can be used to model neural networks. Special emphasis is placed on topology learning. It is concluded that GRAPE grammars offer a great potential for neural networks, giving the possibility of a common language suited for all kinds of neural networks