L-system inversion problem

from Wikipedia, the free encyclopedia

The L-system inversion problem is the problem of inverting an L-system , i.e. to find an L-system for a given character string, which has as short a description as possible.

The L-system inversion problem can be formulated as an optimization problem, where the definition set of the fitness function corresponds to the set of all L-systems.

The (approximate) solution of the L-system inversion problem is the basis of fractal compression .

Web links