AbstractAn explicit formula is derived for the growth function of a DOL-system. This yields an algorithm for deciding whether the growth is (i) exponential independently of the axiom, (ii) polynomial independently of the axiom, or (iii) exponential for some axioms and polynomial for others. Such an algorithm is obtained also by an elementary combinatorial argument. Some comparisons are made with context-dependent Lindenmayer systems
We investigate the descriptional complexity of limited propagating Lindenmayer systems and their det...
AbstractEDTOL systems can be used to approximate real numbers by considering the limit of the ratio ...
summary:Minimizers of a functional with exponential growth are shown to be smooth. The techniques de...
AbstractAn explicit formula is derived for the growth function of a DOL-system. This yields an algor...
AbstractGrowth of word length in some rewriting systems (DOL's) is investigated by combinatorial arg...
AbstractThree types of growth functions of DOL-systems are characterized by means of the poles of th...
Growth functions of informationless Lindenmayer systems are investigated from the point of view of i...
AbstractLindenmayer-systems are a family of string-generating systems, and several types can be dist...
A stochastic version of the 0L systems of Lindenmayer is introduced and the growth functions of such...
AbstractIt is well known that the growth of a context-free language is either polynomial or exponent...
Lindenmayer systems, or L-systems, are a formal model of structural growth due to the theoretical bo...
Polynomially bounded DOL systems are investigated. Necessary and sufficient conditions on the set of...
Lindenmayer-systems are a family of string-generating systems, and several types can be distinguishe...
AbstractLindenmayer systems are a class of parallel rewriting systems originally introduced to model...
AbstractIn this paper we show that the growth of a context-free language is either polynomial or exp...
We investigate the descriptional complexity of limited propagating Lindenmayer systems and their det...
AbstractEDTOL systems can be used to approximate real numbers by considering the limit of the ratio ...
summary:Minimizers of a functional with exponential growth are shown to be smooth. The techniques de...
AbstractAn explicit formula is derived for the growth function of a DOL-system. This yields an algor...
AbstractGrowth of word length in some rewriting systems (DOL's) is investigated by combinatorial arg...
AbstractThree types of growth functions of DOL-systems are characterized by means of the poles of th...
Growth functions of informationless Lindenmayer systems are investigated from the point of view of i...
AbstractLindenmayer-systems are a family of string-generating systems, and several types can be dist...
A stochastic version of the 0L systems of Lindenmayer is introduced and the growth functions of such...
AbstractIt is well known that the growth of a context-free language is either polynomial or exponent...
Lindenmayer systems, or L-systems, are a formal model of structural growth due to the theoretical bo...
Polynomially bounded DOL systems are investigated. Necessary and sufficient conditions on the set of...
Lindenmayer-systems are a family of string-generating systems, and several types can be distinguishe...
AbstractLindenmayer systems are a class of parallel rewriting systems originally introduced to model...
AbstractIn this paper we show that the growth of a context-free language is either polynomial or exp...
We investigate the descriptional complexity of limited propagating Lindenmayer systems and their det...
AbstractEDTOL systems can be used to approximate real numbers by considering the limit of the ratio ...
summary:Minimizers of a functional with exponential growth are shown to be smooth. The techniques de...