Jump to content

String rewriting

From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by LittleDan (talk | contribs) at 13:00, 11 April 2003. The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.
(diff) ← Previous revision | Latest revision (diff) | Newer revision → (diff)

A string rewriting system is a substitution system used to solve equasions using the markov algorithm or create fractals such as the box fractal or cantor dust. In fact, any fractal can be represented as a string rewriting system; it is just easiest in those.