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 show that nonzero axioms add to the generative capacity of Lindenmayerian series generating syste...
AbstractIn this paper we show that the growth of a context-free language is either polynomial or exp...
We determine the computational complexity of membership, emptiness and infiniteness for several typ...
AbstractAn explicit formula is derived for the growth function of a DOL-system. This yields an algor...
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...
AbstractGrowth of word length in some rewriting systems (DOL's) is investigated by combinatorial arg...
A stochastic version of the 0L systems of Lindenmayer is introduced and the growth functions of such...
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 family of string-generating systems, and several types can be dist...
The decidability of equivalence problems for DOL systems has been studied in various papers. One of...
AbstractIt is well known that the growth of a context-free language is either polynomial or exponent...
We investigate the descriptional complexity of limited propagating Lindenmayer systems and their det...
We show that nonzero axioms add to the generative capacity of Lindenmayerian series generating syste...
AbstractIn this paper we show that the growth of a context-free language is either polynomial or exp...
We determine the computational complexity of membership, emptiness and infiniteness for several typ...
AbstractAn explicit formula is derived for the growth function of a DOL-system. This yields an algor...
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...
AbstractGrowth of word length in some rewriting systems (DOL's) is investigated by combinatorial arg...
A stochastic version of the 0L systems of Lindenmayer is introduced and the growth functions of such...
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 family of string-generating systems, and several types can be dist...
The decidability of equivalence problems for DOL systems has been studied in various papers. One of...
AbstractIt is well known that the growth of a context-free language is either polynomial or exponent...
We investigate the descriptional complexity of limited propagating Lindenmayer systems and their det...
We show that nonzero axioms add to the generative capacity of Lindenmayerian series generating syste...
AbstractIn this paper we show that the growth of a context-free language is either polynomial or exp...
We determine the computational complexity of membership, emptiness and infiniteness for several typ...
DOI
Add to ORKG