3[1]Ehrenfeucht A, Rozenberg G , Verraedt R. On inherently ambiguous E0L languages. Theoretical Computer Science, 1984, 28: 197～214
4[2]Fernau H. Membership for 1-limited ET0L languages is not decidable. Journal of Information Processing, Cybernet, 1994, EIK-30: 191～211
5[3]Fernau H, Waetjen D. Remarks on regulated limited ET0L systems and regulated context free grammars. Theoretical Computer Science, 1998, 194: 35～55
6[4]Waetjen D. Regulations of uniformly k-limited ET0L systems and their relations to controlled context-free grammars. J Automata, Languages, and Combinatorics, 1996, 1: 55～74
7[5]Rozenberg G , Salomaa A. The Mathematical Theory of L Systems. New York: Academic Press, 1980
8[6]Coveney P, Highfield R. Frontiers of Complexity. London: Faber and Faber, 6, 1995
9[7]Maurer H A, Salomaa A A, Wood D. Bounded delay L codes. Theoretical Computer Science, 1991, 62(2): 265～279
10[8]Lindenmayer A, Prusinkiewicz P. The Algorithmic Beauty of Plants. Berlin: Springer-Verlag, 1990
5Barnsley MF. Fractal functions and interpolation[J]. Constructive Approximation, 1986, 2(2):303-329.
6Xie H, Sun H, Ju Y. Study On generation of rock surface by using fractal nterpolation[J].International Journal of Solid andStructure, 2001,38:5765-5787.
