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.
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.