为了更高效地表示分形图形，依据形式语言的文法结构及正则表达式的文法规则，通过引入代数运算，提出了一个能够对L系统和迭代函数系统(IFS)统一描述的语言代数系统。根据语言代数系统产生式的文法规则，将此系统的产生式集划分为五类。结合分形理论，此语言代数系统着重将DOL系统、迭代函数系统(IFS)、带凝聚集迭代函数系统(凝聚IFS)、随机迭代函数系统(IFSP)和再归迭代函数系统(RIFS)等进行描述，同时用此系统的正则表达式方程解将分形吸引子进行代数表示，并给出一些实例。通过实例表明，分形图形可以用该语言代数系统简单、明了、高效地表示。

A formal language which is simply a set of sequences is composed of some sentences according to certain rules or symbol strings of finite or infinite sets, and formal language theory considers finite descriptions of languages. We are particularly interested in description methods that are easy to understand and use, lead to algorithms for analyzing sequences and are suitable for automated processing. Based on the formal language structure and the grammar rules of regular expressions, an algebraic language systems which can describe L system and iterated function system (IFS) uniformly is proposed by employing algebra. According to the grammar rules generated by the algebraic language systems, Five types of this system production is characterized. Under the algebraic language systems, the DOL system, IFS, condensation IFS, IFSP, and RIFS are mainly described by combining with fractal theory, then fractal attractor is ex?pressed by the regular expression equations of this system, and some examples are given. As examples showed, some fractal graphics can be constructed simply, clearly and efficiently by the language of algebraic system.