AbstractA 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 IL 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 DOL system and to an EOL system. Since this equivalence is effective, some properties which are formally undecidable for general DIL systems can be shown to be decidable for deterministic bounded systems
In an infinite sequence of words over a finite alphabet some word must be embedded in a later word. ...
A stochastic version of the 0L systems of Lindenmayer is introduced and the growth functions of such...
AbstractA OL system is called a quasi-deterministic OL system or a D'OL system for short if there is...
AbstractThis paper proves the decidability of several problems in the theory of HD0L, D0L and PD0L s...
A restricted version of interactive L systems is introduced. A P2L system is called an essentially g...
The decidability of equivalence problems for DOL systems has been studied in various papers. One of...
AbstractIn this paper, we consider parallel communicating systems where the components of the system...
AbstractIn this paper, generalizations to systems which are not persistent, that is, systems where a...
One of the questions of the longest open standing in the area of Lindenmayer-systems is the decidabi...
We study the computational complexity of some decidable systems. The problems are membership. empti...
International audienceWe introduce and explore a type of discrete dynamic system inheriting some pro...
AbstractWe show that language equivalence is decidable for HD0L systems having D0L growths. By defin...
. L Systems are a mathematical formalism originally designed to model the biological growth of plant...
In this paper we present the research that has been done with Linear Dynamical Systems to generate a...
AbstractIn this paper, we extend the manner of defining the evolution update of discrete dynamical s...
In an infinite sequence of words over a finite alphabet some word must be embedded in a later word. ...
A stochastic version of the 0L systems of Lindenmayer is introduced and the growth functions of such...
AbstractA OL system is called a quasi-deterministic OL system or a D'OL system for short if there is...
AbstractThis paper proves the decidability of several problems in the theory of HD0L, D0L and PD0L s...
A restricted version of interactive L systems is introduced. A P2L system is called an essentially g...
The decidability of equivalence problems for DOL systems has been studied in various papers. One of...
AbstractIn this paper, we consider parallel communicating systems where the components of the system...
AbstractIn this paper, generalizations to systems which are not persistent, that is, systems where a...
One of the questions of the longest open standing in the area of Lindenmayer-systems is the decidabi...
We study the computational complexity of some decidable systems. The problems are membership. empti...
International audienceWe introduce and explore a type of discrete dynamic system inheriting some pro...
AbstractWe show that language equivalence is decidable for HD0L systems having D0L growths. By defin...
. L Systems are a mathematical formalism originally designed to model the biological growth of plant...
In this paper we present the research that has been done with Linear Dynamical Systems to generate a...
AbstractIn this paper, we extend the manner of defining the evolution update of discrete dynamical s...
In an infinite sequence of words over a finite alphabet some word must be embedded in a later word. ...
A stochastic version of the 0L systems of Lindenmayer is introduced and the growth functions of such...
AbstractA OL system is called a quasi-deterministic OL system or a D'OL system for short if there is...