# Is it possible a recursive compression algorithm based on L-systems or a variant?

According to the Internet, there's a way to get an L-system's rules by it's string, unfortunately I can't read it because it's behind a paywall.

Question: If that paper is right, is it possible to make an algorithm, based on L-systems, to recursively reduce let's say a blob of 64MB of zeros and ones down to:

• A "small" starting axiom.
• A set of variables/constants/you-name-it.
• A set of rules.
• The number n of iterations required.

/Question End

Compression is all about entropy and something in my guts says this isn't possible, I'd like someone with more experience to confirm it.

• Isn't this essentially how Lempel-Ziv-etc works? – Jeffε Sep 12 '13 at 12:39
• @JɛﬀE Isn't LZ- just one pass? – toqueteos Sep 12 '13 at 15:03
• all grammars can double as compression algorithms. & $K(x)$ from kolmogorov complexity is the ultimate grammar compression. – vzn Sep 13 '13 at 4:23