by Aristid Lindenmayer and Grzegorz Rozenberg}, booktitle = {Automata, languages, development : at the crossroads of biology, mathematics and computer science / ...
On a Generalization of Lindenmayer-Systems to Labelled Graphs. Nagl, Manfred. Amsterdam [u.a.] : North-Holland Publ. Co. (1976) Contribution to a book.
May 24, 2005 · Nagl, M.: On a Generalization of Lindenmayer-Systems to Labelled Graphs, in A. Lindenmayer/G. Rozenberg(Ed.): Automata,Languages,Development, ...
Lindenmayer systems — or L-systems for short — were conceived as a mathematical theory of plant development [82]. Originally, they did.
Missing: Labelled | Show results with:Labelled
Placing a control point in the middle of each straight segment results in a generalized cylinder that closely follows the original branching structure in Figure ...
Sep 9, 2024 · Combinatorial generation of expander families and Lindenmayer-style development models are both parallel in nature.
On a Generalization of Lindenmayer-Systems to Labelled Graphs · M. Nagl. Computer Science, Mathematics. Automata, Languages, Development. 1975. 14 Citations.
However, the extension of L-systems to graphs with cycles seems to be a different from the map L-systems of Lindenmayer and the double-wall L-systems of the ...
This paper presents the applicability of graph L-systems to the generation of two- dimensional pictures. It is shown that the class of graphs generated by ...
Missing: Generalization | Show results with:Generalization
We introduce a novel class of labeled directed acyclic graph (LDAG) models for finite sets of discrete variables. LDAGs generalize earlier proposals for ...