The Generation of a Sort of Fractal Graphs

We present an approach for generating a sort of fractal graphs by a simpleprobabilistic logic neuron network and show that the graphs can be representedby a set of compressed codings. An algorithm for quickly finding the codings,i.e., recognizing the corresponding graphs, is given. The codings are shown tobe optimal. The results above possibly give us the clue for studying imagecompression and pattern recognition.