Interactive L systems with a fast local growth
A property typical to fastly growing parallel systems is discussed and studied in the framework of L system theory. This property is true of the members of a large subclass of the 1L class, called bounded systems, which grow very rapidly, in a certain well defined sense. It is shown that every deterministic bounded system is equivalent to a coding of a D0L system and to an E0L system. Since this equivalence is effective, some properties which are formally undecidable for general D1L systems can be shown to be decidable for deterministic bounded systems.
- Description of developmental languages using recurrence systems
- scientific article; zbMATH DE number 3684912 (Why is no real title available?)
- scientific article; zbMATH DE number 3464865 (Why is no real title available?)
- Interactive L systems with almost interactionless behaviour
- The decidability of the equivalence problem for DOL-systems
- The equality of EOL languages and codings of ol languages
- scientific article; zbMATH DE number 3848619 (Why is no real title available?)
- scientific article; zbMATH DE number 3858419 (Why is no real title available?)
- scientific article; zbMATH DE number 3880124 (Why is no real title available?)
- Existence, uniqueness, and algorithmic computation of general lilypond systems
- scientific article; zbMATH DE number 3976350 (Why is no real title available?)
- scientific article; zbMATH DE number 4059174 (Why is no real title available?)
- Three variants of apical growth filamentous systems
- scientific article; zbMATH DE number 176927 (Why is no real title available?)
- Subapical bracketed L-systems
This page was built for publication: Interactive L systems with a fast local growth
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1115192)