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.

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

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

Browse other questions tagged or ask your own question.