From their self-similarity transformation, authors deduce their analytic representation, and from the correspondence relationship between them and the character string space, authors calculate their Hausdorff dimension.
Four methods of the theory are summarized and their virtues and shortcomings are analyzed. These methods include string avoidance method combined automata proposed by Sreenvias and Krogh, inhibitor arc method proposed by Uzam and Jones et al, state avoidance controller method based on inhibitor arc proposed by Cho and Kwon and weighted inhibitor arc method proposed by Wu and Su et al.
(3) reproduction represent imitation behaviors of agents, strings with high fitness value indicate that agent have higher fitness value in present condition and believes of those agents will be copied by many other agents;
In this paper we introduced the Concept of thelongest common Substring of two Character strings, and presented twoquick algorithms of searching the Lengest common Substring on thebasis of the theoretical anlysis of this cencept.