We show that nonzero axioms add to the generative capacity of Lindenmayerian series generating systems. On the other hand, if nonzero axioms are allowed, nonterminals do not, provided that only quasiregular series are considered
AbstractLindenmayer-systems are a family of string-generating systems, and several types can be dist...
We present here a package of Macsyma programs, allowing the manipulation of words, and noncommutativ...
Lindenmayer-systems are a family of string-generating systems, and several types can be distinguishe...
AbstractWe define Lindenmayerian algebraic power series and study their properties. These series gen...
AbstractWe show that equivalence is decidable for D0L systems with finite axiom sets. We discuss als...
In this paper we study the nonterminal complexity of Lindenmayer systems with respect to tree contro...
We investigate the descriptional complexity of limited propagating Lindenmayer systems and their det...
AbstractAn explicit formula is derived for the growth function of a DOL-system. This yields an algor...
We define L rational and L recognizable power series, and establish a Kleene-Schützenberger theorem ...
Abstract: We show that it is decidable whether or not a given D0L power series over a semiring A is ...
We show that it is decidable whether or not a given D0L power series over a semiring A is A-algebrai...
AbstractWe define and study Lindenmayerian algebraic sequences. These sequences are a generalization...
AbstractThe definitions of a piecewise deterministic zero Lindenmayer (PWD0L) scheme and system are ...
In nonlinear control, it is helpful to choose a formalism well suited to computations involving solu...
AbstractLindenmayer systems are a class of parallel rewriting systems originally introduced to model...
AbstractLindenmayer-systems are a family of string-generating systems, and several types can be dist...
We present here a package of Macsyma programs, allowing the manipulation of words, and noncommutativ...
Lindenmayer-systems are a family of string-generating systems, and several types can be distinguishe...
AbstractWe define Lindenmayerian algebraic power series and study their properties. These series gen...
AbstractWe show that equivalence is decidable for D0L systems with finite axiom sets. We discuss als...
In this paper we study the nonterminal complexity of Lindenmayer systems with respect to tree contro...
We investigate the descriptional complexity of limited propagating Lindenmayer systems and their det...
AbstractAn explicit formula is derived for the growth function of a DOL-system. This yields an algor...
We define L rational and L recognizable power series, and establish a Kleene-Schützenberger theorem ...
Abstract: We show that it is decidable whether or not a given D0L power series over a semiring A is ...
We show that it is decidable whether or not a given D0L power series over a semiring A is A-algebrai...
AbstractWe define and study Lindenmayerian algebraic sequences. These sequences are a generalization...
AbstractThe definitions of a piecewise deterministic zero Lindenmayer (PWD0L) scheme and system are ...
In nonlinear control, it is helpful to choose a formalism well suited to computations involving solu...
AbstractLindenmayer systems are a class of parallel rewriting systems originally introduced to model...
AbstractLindenmayer-systems are a family of string-generating systems, and several types can be dist...
We present here a package of Macsyma programs, allowing the manipulation of words, and noncommutativ...
Lindenmayer-systems are a family of string-generating systems, and several types can be distinguishe...
DOI
Add to ORKG