Jump to content

String rewriting

From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by 217.37.214.121 (talk) at 13:53, 11 April 2003 (perform computation, L-system). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

A string rewriting system is a substitution system used to perform computation using Markov algorithms or create certain types of fractals such as the Cantor set or Menger sponge.

See also: L-system