The decidability of equivalence problems for DOL systems has been studied in various papers. One of the questions left open in these papers, is the decidability of what one might call the growth range equivalence problem. Two DOL systems are said to be equivalent if the ranges of their growth functions coincide. This problem is proved to be decidable.Published in: A. Lindenmayer & G. Rozenberg (ed.) Automata, Languages and Development, North-Holland, 1976
AbstractWe show by a simple argument how any algorithm for solving the D0L language equivalence prob...
AbstractTo test the equivalence of two binary D0L sequences it suffices to compare the first four te...
This is the published version of a work that was accepted for publication in Theoretical Computer Sc...
AbstractWe show that language equivalence is decidable for HD0L systems having D0L growths. By defin...
One of the questions of the longest open standing in the area of Lindenmayer-systems is the decidabi...
AbstractThis paper proves the decidability of several problems in the theory of HD0L, D0L and PD0L s...
AbstractWe show that equivalence is decidable for D0L systems with finite axiom sets. We discuss als...
AbstractA property, called smoothness, of a family of DOL-systems is introduced. It is shown that th...
AbstractAn explicit bound is given for a solution of the DOL sequence equivalence problem; that is, ...
It is shown that decidability of equivalence between an FDOL language and a DOL language implies tha...
AbstractWe show that sequence equivalence, language equivalence, growth equivalence and road equival...
The language and sequence equivalence problem for DOL-systems is shown to be decidable. In an algebr...
AbstractThis paper continues the research on elementary D0L systems. In particular we provide an alt...
AbstractWe have recently proved that there is a bound for the sequence equivalence problem of polyno...
AbstractWe study DOL systems with immigration. We show that sequence and growth equivalence are deci...
AbstractWe show by a simple argument how any algorithm for solving the D0L language equivalence prob...
AbstractTo test the equivalence of two binary D0L sequences it suffices to compare the first four te...
This is the published version of a work that was accepted for publication in Theoretical Computer Sc...
AbstractWe show that language equivalence is decidable for HD0L systems having D0L growths. By defin...
One of the questions of the longest open standing in the area of Lindenmayer-systems is the decidabi...
AbstractThis paper proves the decidability of several problems in the theory of HD0L, D0L and PD0L s...
AbstractWe show that equivalence is decidable for D0L systems with finite axiom sets. We discuss als...
AbstractA property, called smoothness, of a family of DOL-systems is introduced. It is shown that th...
AbstractAn explicit bound is given for a solution of the DOL sequence equivalence problem; that is, ...
It is shown that decidability of equivalence between an FDOL language and a DOL language implies tha...
AbstractWe show that sequence equivalence, language equivalence, growth equivalence and road equival...
The language and sequence equivalence problem for DOL-systems is shown to be decidable. In an algebr...
AbstractThis paper continues the research on elementary D0L systems. In particular we provide an alt...
AbstractWe have recently proved that there is a bound for the sequence equivalence problem of polyno...
AbstractWe study DOL systems with immigration. We show that sequence and growth equivalence are deci...
AbstractWe show by a simple argument how any algorithm for solving the D0L language equivalence prob...
AbstractTo test the equivalence of two binary D0L sequences it suffices to compare the first four te...
This is the published version of a work that was accepted for publication in Theoretical Computer Sc...
Add to ORKG