umu.sePublications
Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Tree-based generation of languages of fractals
Umeå University, Faculty of Science and Technology, Departement of Computing Science.
2001 (English)In: Theoretical Computer Science, Vol. 262, no 1-2, 377-414 p.Article in journal (Refereed) Published
Abstract [en]

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.

Place, publisher, year, edition, pages
2001. Vol. 262, no 1-2, 377-414 p.
Identifiers
URN: urn:nbn:se:umu:diva-21890ISBN: 0304-3975 OAI: oai:DiVA.org:umu-21890DiVA: diva2:212161
Available from: 2009-04-21 Created: 2009-04-21 Last updated: 2009-04-21

Open Access in DiVA

No full text

Other links

<Go to ISI>://000169594100021
By organisation
Departement of Computing Science

Search outside of DiVA

GoogleGoogle Scholar

isbn
urn-nbn

Altmetric score

isbn
urn-nbn
Total: 20 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf