AbstractA property, called smoothness, of a family of DOL-systems is introduced. It is shown that the sequence equivalence problem is decidable for every smooth family of DOL-systems.Then a large subfamily of DOL-systems, called simple DOL-systems is shown to be smooth
It is shown that to test whether two DOL sequences in the binary case coincide it is enough to test ...
AbstractWe show that sequence equivalence, language equivalence, growth equivalence and road equival...
AbstractWe will discuss several recently developed techniques for proving the decidability of the eq...
AbstractA property, called smoothness, of a family of DOL-systems is introduced. It is shown that th...
The language and sequence equivalence problem for DOL-systems is shown to be decidable. In an algebr...
One of the questions of the longest open standing in the area of Lindenmayer-systems is the decidabi...
The decidability of equivalence problems for DOL systems has been studied in various papers. One of...
AbstractAn explicit bound is given for a solution of the DOL sequence equivalence problem; that is, ...
AbstractThis paper continues the research on elementary D0L systems. In particular we provide an alt...
AbstractWe study DOL systems with immigration. We show that sequence and growth equivalence are deci...
We discuss three variants of the DT0L sequence equivalence problem. One of the variants generalizes ...
It is shown that decidability of equivalence between an FDOL language and a DOL language implies tha...
AbstractWe show by a simple argument how any algorithm for solving the D0L language equivalence prob...
AbstractWe have recently proved that there is a bound for the sequence equivalence problem of polyno...
AbstractWe show that language equivalence is decidable for HD0L systems having D0L growths. By defin...
It is shown that to test whether two DOL sequences in the binary case coincide it is enough to test ...
AbstractWe show that sequence equivalence, language equivalence, growth equivalence and road equival...
AbstractWe will discuss several recently developed techniques for proving the decidability of the eq...
AbstractA property, called smoothness, of a family of DOL-systems is introduced. It is shown that th...
The language and sequence equivalence problem for DOL-systems is shown to be decidable. In an algebr...
One of the questions of the longest open standing in the area of Lindenmayer-systems is the decidabi...
The decidability of equivalence problems for DOL systems has been studied in various papers. One of...
AbstractAn explicit bound is given for a solution of the DOL sequence equivalence problem; that is, ...
AbstractThis paper continues the research on elementary D0L systems. In particular we provide an alt...
AbstractWe study DOL systems with immigration. We show that sequence and growth equivalence are deci...
We discuss three variants of the DT0L sequence equivalence problem. One of the variants generalizes ...
It is shown that decidability of equivalence between an FDOL language and a DOL language implies tha...
AbstractWe show by a simple argument how any algorithm for solving the D0L language equivalence prob...
AbstractWe have recently proved that there is a bound for the sequence equivalence problem of polyno...
AbstractWe show that language equivalence is decidable for HD0L systems having D0L growths. By defin...
It is shown that to test whether two DOL sequences in the binary case coincide it is enough to test ...
AbstractWe show that sequence equivalence, language equivalence, growth equivalence and road equival...
AbstractWe will discuss several recently developed techniques for proving the decidability of the eq...
DOI
Add to ORKG