The notion of P-interpreted top-down tree generators is introduced, combining the nondeterministic nature of grammars as known from formal language theory with the infinite refinement of pictures studied in fractal geometry. (C) 2001 Elsevier Science B.V. All rights reserved. [References: 26]
展开▼