Article,
Cellular encoding as a graph grammar
IEE Colloquium on Grammatical Inference: Theory, Applications and Alternatives, (22-23 April 1993)
Abstract
ABSTRACT Cellular encoding is a method for encoding a
family of neural networks into a set of labeled trees.
Such sets of trees can be evolved by the genetic
algorithm so as to find a particular set of trees that
encodes a family of Boolean neural networks for
computing a family of Boolean functions. Cellular
encoding is presented as a graph grammar. A method is
proposed for translating a cellular encoding into a set
of graph grammar rewriting rules of the kind used in
the Berlin algebraic approach to graph rewriting. The
genetic search of neural networks via cellular encoding
appears as a grammatical inference process where the
language to parse is implicitly specified, instead of
explicitly by positive and negative examples.
Experimental results shows that the genetic algorithm
can infer grammars that derive neural networks for the
parity, symmetry and decoder Boolean function of
arbitrary large size.
