Genetically generated ASCII trees

2021 ◽  
Vol 14 (1) ◽  
pp. 16-17
Author(s):  
Alec Pugh
Keyword(s):  
Genetic Algorithms ◽  
Lindenmayer Systems ◽  
Tree Generation ◽  
L Systems

This project, inspired by the article: "On genetic algorithms and Lindenmayer systems" by Gabriela Ochoa, implements an ASCII tree-generation program using L-systems.

Searching neural network structures with L systems and genetic algorithms

1999 ◽  
Vol 73 (1) ◽  
pp. 55-75 ◽  
Author(s):  
Isto Aho ◽  
Harri Kemppainen ◽  
Kai Koskimies ◽  
Erkki MÃkinen ◽  
Tapio Niemi
Keyword(s):  
Neural Network ◽  
Genetic Algorithms ◽  
Network Structures ◽  
L Systems

ON THE NUMBER OF ACTIVE SYMBOLS IN LINDENMAYER SYSTEMS

2011 ◽  
Vol 22 (01) ◽  
pp. 223-235 ◽  
Author(s):  
JÜRGEN DASSOW ◽  
GYÖRGY VASZIL
Keyword(s):  
Lindenmayer Systems ◽  
L System ◽  
L Systems

A symbol a is called active in an L system G if there is a rule a → υ with a ≠ υ in some table of G. By AcX(L) we denote the number of active symbols necessary to generate L by L systems of type X. For two types X and Y of L systems such that the corresponding languages families [Formula: see text] and [Formula: see text] satisfy [Formula: see text], we say that Y is more efficient than X, if there is a sequence of languages [Formula: see text], n ≥ 1, such that AcX(Ln) ≥ n and AcY(Ln) ≤ k for some constant k. In this paper we shall show that the inclusion [Formula: see text] implies that Y is more efficient than X. Analogous results are presented for some modifications of the measure of active symbols.

scholarly journals On the Decidability of some Equivalence Problems for D0L-Systems

1973 ◽  
Vol 2 (20) ◽  
Author(s):  
Mogens Nielsen
Keyword(s):  
Open Problem ◽  
Equivalence Problem ◽  
Lindenmayer Systems ◽  
L Systems ◽  
And Control ◽  
Equivalence Problems

One of the questions of the longest open standing in the area of Lindenmayer-systems is the decidability of the equivalence problem for deterministic, informationless L-systems (DOL-Systems). This and some related equivalence-problems (equivalence with respect to the set and the sequence of generated words, Parikh-vectors and word-lengths) are investigated. Some of these related problems are shown to be recursively solvable, and the implications of these results on the main open problem mentioned above are discussed. (The paper has been accepted for publication in Information and Control).

scholarly journals VARIASI POHON FRAKTAL MENGGUNAKAN L-SYSTEMS

2021 ◽  
Vol 21 (2) ◽  
pp. 77
Author(s):  
Pradifta Gilang Ramdhan ◽  
Kosala D. Purnomo ◽  
Firdaus Ubaidillah
Keyword(s):  
Branch Length ◽  
Production Rules ◽  
Tree Patterns ◽  
Branch Angle ◽  
Left Branch ◽  
Tree Generation ◽  
L Systems ◽  
Thickness Variations ◽  
The Right ◽  
Parameter Values

Fractal tree is simply a trunk and a number of branches, each of which looks like the tree itself. The fractal tree can be generated using the IFS and L-Systems methods. In this article, the author develops fractal tree generation using L-Systems with additional variations. The variations given are in thickness, length, and branch angle. This development is expected to produce more diverse fractal tree patterns. In generating a fractal tree using L-Systems, it begins by determining the letters and symbols to be used. Then determine which axioms should be used. Then the production rules are made together with the determination of the parametric L-Systems. And the last is to determine the probability value for the stochastic L-Systems. In the deterministic L-Systems, thickness variations, length variations, and branch angle variations are carried out. In the variation of branch thickness, if the ratio of the thickness of the left branch is greater than that of the right branch, the fractal tree is skewed to the left. Then in the variation of branch length if the ratio of the length of the left branch is smaller than the ratio of the length of the right branch, the length of the left branch is longer than the length of the right branch. Then at the angle of the branching the smaller the 𝜃 that is included causes the branches to be closer together. The use of stochastic L-Systems can produce more diverse fractal tree patterns, even though they use the same production rules and parameter values

Non-Standard Sound Synthesis with L-Systems

2009 ◽  
Vol 19 ◽  
pp. 85-94 ◽  
Author(s):  
Stelios Manousakis
Keyword(s):  
Genetic Algorithms ◽  
Time Domain ◽  
Standard Technique ◽  
Sound Synthesis ◽  
Implementation Model ◽  
L System ◽  
Waveform Synthesis ◽  
L Systems ◽  
The Time Domain ◽  
Compositional System

This paper presents a new non-standard technique for waveform synthesis in the time domain using L-systems, a formalism related to grammars, fractals and automata. This technique, developed as part of a larger-scale compositional system, is based on waveform segmentation and offers various methods for generating wavetables. The paper first introduces L-systems and some specifics of their interpretation and discusses extensions such as incorporating genetic algorithms and designing hierarchical L-systems and L-system networks. The second half describes the implementation model in detail, proposes some sound synthesis strategies and presents paths for further work.

scholarly journals Complexity of Some Problems Concerning Lindenmayer Systems. (Revised version)

1979 ◽  
Vol 7 (85) ◽  
Author(s):  
Neil D. Jones ◽  
Sven Skyum
Keyword(s):  
Computational Complexity ◽  
Lower Bounds ◽  
Upper And Lower Bounds ◽  
Turing Machines ◽  
Lindenmayer Systems ◽  
L Systems

<p>We determine the computational complexity of membership, emptiness and infiniteness for several types of L systems. The L systems we consider are EDOL, EOL, EDTOL, and ETOL, with and without empty productions. For each problem and each type of system we establish both upper and lower bounds on the time or memory required for solution by Turing machines.</p><p>Revised version (first version 1978 under the title <em>Complexity of Some Problems Concerning: Lindenmayer Systems</em>)</p>

scholarly journals Physarum Polycephalum Syllogistic L-Systems and Judaic Roots of Unconventional Computing

2016 ◽  
Vol 44 (1) ◽  
pp. 181-201 ◽  
Author(s):  
Andrew Schumann
Keyword(s):  
Physarum Polycephalum ◽  
Unconventional Computing ◽  
Lindenmayer Systems ◽  
L Systems

Abstract We show that in Kabbalah, the esoteric teaching of Judaism, there were developed ideas of unconventional automata in which operations over characters of the Hebrew alphabet can simulate all real processes producing appropriate strings in accordance with some algorithms. These ideas may be used now in a syllogistic extension of Lindenmayer systems (L-systems), where we deal also with strings in the Kabbalistic-Leibnizean meaning. This extension is illustrated by the behavior of Physarum polycephalum plasmodia which can implement, first, the Aristotelian syllogistic and, second, a Talmudic syllogistic by qal wa-homer.

scholarly journals Arterial Branching within the Confines of Fractal L-System Formalism

2001 ◽  
Vol 118 (3) ◽  
pp. 267-276 ◽  
Author(s):  
M. Zamir
Keyword(s):  
Asymmetry Ratio ◽  
Lindenmayer Systems ◽  
Fractal Structures ◽  
Random Choice ◽  
Tree Structures ◽  
L System ◽  
Branching Patterns ◽  
Fractal Characteristics ◽  
L Systems ◽  
The Asymmetry

Parametric Lindenmayer systems (L-systems) are formulated to generate branching tree structures that can incorporate the physiological laws of arterial branching. By construction, the generated trees are de facto fractal structures, and with appropriate choice of parameters, they can be made to exhibit some of the branching patterns of arterial trees, particularly those with a preponderant value of the asymmetry ratio. The question of whether arterial trees in general have these fractal characteristics is examined by comparison of pattern with vasculature from the cardiovascular system. The results suggest that parametric L-systems can be used to produce fractal tree structures but not with the variability in branching parameters observed in arterial trees. These parameters include the asymmetry ratio, the area ratio, branch diameters, and branching angles. The key issue is that the source of variability in these parameters is not known and, hence, it cannot be accurately reproduced in a model. L-systems with a random choice of parameters can be made to mimic some of the observed variability, but the legitimacy of that choice is not clear.

Sign in / Sign up

Export Citation Format

Share Document