expressivity of graph directed IFS and L-systems












1












$begingroup$


In my answer to Does there exist a L-system for this Pierced Diamond Fractal? I asserted that graph directed iterated function systems of similarities have equivalent expressive power to L-systems. Is this true? A reference would be appreciated.










share|cite|improve this question









$endgroup$












  • $begingroup$
    So-called "Parametric L-Systems", described in section 1.10 of The Algorithmic Beauty of Plants, can generate borderline fractals (as described in this paper) that cannot be generated with digraph IFSs. Barring parameters, it makes perfect sense to me that L-Systems and digraph IFSs should be able to describe the same sets but I don't have a reference.
    $endgroup$
    – Mark McClure
    Dec 5 '18 at 13:06
















1












$begingroup$


In my answer to Does there exist a L-system for this Pierced Diamond Fractal? I asserted that graph directed iterated function systems of similarities have equivalent expressive power to L-systems. Is this true? A reference would be appreciated.










share|cite|improve this question









$endgroup$












  • $begingroup$
    So-called "Parametric L-Systems", described in section 1.10 of The Algorithmic Beauty of Plants, can generate borderline fractals (as described in this paper) that cannot be generated with digraph IFSs. Barring parameters, it makes perfect sense to me that L-Systems and digraph IFSs should be able to describe the same sets but I don't have a reference.
    $endgroup$
    – Mark McClure
    Dec 5 '18 at 13:06














1












1








1





$begingroup$


In my answer to Does there exist a L-system for this Pierced Diamond Fractal? I asserted that graph directed iterated function systems of similarities have equivalent expressive power to L-systems. Is this true? A reference would be appreciated.










share|cite|improve this question









$endgroup$




In my answer to Does there exist a L-system for this Pierced Diamond Fractal? I asserted that graph directed iterated function systems of similarities have equivalent expressive power to L-systems. Is this true? A reference would be appreciated.







reference-request fractals






share|cite|improve this question













share|cite|improve this question











share|cite|improve this question




share|cite|improve this question










asked Dec 4 '18 at 17:18









ClaudeClaude

2,518523




2,518523












  • $begingroup$
    So-called "Parametric L-Systems", described in section 1.10 of The Algorithmic Beauty of Plants, can generate borderline fractals (as described in this paper) that cannot be generated with digraph IFSs. Barring parameters, it makes perfect sense to me that L-Systems and digraph IFSs should be able to describe the same sets but I don't have a reference.
    $endgroup$
    – Mark McClure
    Dec 5 '18 at 13:06


















  • $begingroup$
    So-called "Parametric L-Systems", described in section 1.10 of The Algorithmic Beauty of Plants, can generate borderline fractals (as described in this paper) that cannot be generated with digraph IFSs. Barring parameters, it makes perfect sense to me that L-Systems and digraph IFSs should be able to describe the same sets but I don't have a reference.
    $endgroup$
    – Mark McClure
    Dec 5 '18 at 13:06
















$begingroup$
So-called "Parametric L-Systems", described in section 1.10 of The Algorithmic Beauty of Plants, can generate borderline fractals (as described in this paper) that cannot be generated with digraph IFSs. Barring parameters, it makes perfect sense to me that L-Systems and digraph IFSs should be able to describe the same sets but I don't have a reference.
$endgroup$
– Mark McClure
Dec 5 '18 at 13:06




$begingroup$
So-called "Parametric L-Systems", described in section 1.10 of The Algorithmic Beauty of Plants, can generate borderline fractals (as described in this paper) that cannot be generated with digraph IFSs. Barring parameters, it makes perfect sense to me that L-Systems and digraph IFSs should be able to describe the same sets but I don't have a reference.
$endgroup$
– Mark McClure
Dec 5 '18 at 13:06










0






active

oldest

votes











Your Answer





StackExchange.ifUsing("editor", function () {
return StackExchange.using("mathjaxEditing", function () {
StackExchange.MarkdownEditor.creationCallbacks.add(function (editor, postfix) {
StackExchange.mathjaxEditing.prepareWmdForMathJax(editor, postfix, [["$", "$"], ["\\(","\\)"]]);
});
});
}, "mathjax-editing");

StackExchange.ready(function() {
var channelOptions = {
tags: "".split(" "),
id: "69"
};
initTagRenderer("".split(" "), "".split(" "), channelOptions);

StackExchange.using("externalEditor", function() {
// Have to fire editor after snippets, if snippets enabled
if (StackExchange.settings.snippets.snippetsEnabled) {
StackExchange.using("snippets", function() {
createEditor();
});
}
else {
createEditor();
}
});

function createEditor() {
StackExchange.prepareEditor({
heartbeatType: 'answer',
autoActivateHeartbeat: false,
convertImagesToLinks: true,
noModals: true,
showLowRepImageUploadWarning: true,
reputationToPostImages: 10,
bindNavPrevention: true,
postfix: "",
imageUploader: {
brandingHtml: "Powered by u003ca class="icon-imgur-white" href="https://imgur.com/"u003eu003c/au003e",
contentPolicyHtml: "User contributions licensed under u003ca href="https://creativecommons.org/licenses/by-sa/3.0/"u003ecc by-sa 3.0 with attribution requiredu003c/au003e u003ca href="https://stackoverflow.com/legal/content-policy"u003e(content policy)u003c/au003e",
allowUrls: true
},
noCode: true, onDemand: true,
discardSelector: ".discard-answer"
,immediatelyShowMarkdownHelp:true
});


}
});














draft saved

draft discarded


















StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3025855%2fexpressivity-of-graph-directed-ifs-and-l-systems%23new-answer', 'question_page');
}
);

Post as a guest















Required, but never shown

























0






active

oldest

votes








0






active

oldest

votes









active

oldest

votes






active

oldest

votes
















draft saved

draft discarded




















































Thanks for contributing an answer to Mathematics Stack Exchange!


  • Please be sure to answer the question. Provide details and share your research!

But avoid



  • Asking for help, clarification, or responding to other answers.

  • Making statements based on opinion; back them up with references or personal experience.


Use MathJax to format equations. MathJax reference.


To learn more, see our tips on writing great answers.




draft saved


draft discarded














StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3025855%2fexpressivity-of-graph-directed-ifs-and-l-systems%23new-answer', 'question_page');
}
);

Post as a guest















Required, but never shown





















































Required, but never shown














Required, but never shown












Required, but never shown







Required, but never shown

































Required, but never shown














Required, but never shown












Required, but never shown







Required, but never shown







Popular posts from this blog

Plaza Victoria

Puebla de Zaragoza

Musa