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
AbstractThe notion of balance of two morphisms on a given language is generalized to deal with the w...
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...
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...
It is shown that decidability of equivalence between an FDOL language and a DOL language implies tha...
AbstractThis paper continues the research on elementary D0L systems. In particular we provide an alt...
AbstractWe show by a simple argument how any algorithm for solving the D0L language equivalence prob...
One of the questions of the longest open standing in the area of Lindenmayer-systems is the decidabi...
AbstractAn explicit bound is given for a solution of the DOL sequence equivalence problem; that is, ...
The decidability of equivalence problems for DOL systems has been studied in various papers. One of...
AbstractWe will discuss several recently developed techniques for proving the decidability of the eq...
AbstractWe study DOL systems with immigration. We show that sequence and growth equivalence are deci...
AbstractWe have recently proved that there is a bound for the sequence equivalence problem of polyno...
AbstractIt is shown that it is decidable of any endomorphisms σ, σ1…, σm and any words P, P1…, Pn wh...
AbstractThe notion of balance of two morphisms on a given language is generalized to deal with the w...
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...
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...
It is shown that decidability of equivalence between an FDOL language and a DOL language implies tha...
AbstractThis paper continues the research on elementary D0L systems. In particular we provide an alt...
AbstractWe show by a simple argument how any algorithm for solving the D0L language equivalence prob...
One of the questions of the longest open standing in the area of Lindenmayer-systems is the decidabi...
AbstractAn explicit bound is given for a solution of the DOL sequence equivalence problem; that is, ...
The decidability of equivalence problems for DOL systems has been studied in various papers. One of...
AbstractWe will discuss several recently developed techniques for proving the decidability of the eq...
AbstractWe study DOL systems with immigration. We show that sequence and growth equivalence are deci...
AbstractWe have recently proved that there is a bound for the sequence equivalence problem of polyno...
AbstractIt is shown that it is decidable of any endomorphisms σ, σ1…, σm and any words P, P1…, Pn wh...
AbstractThe notion of balance of two morphisms on a given language is generalized to deal with the w...
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...
DOI
Add to ORKG