DOIAbstract
AbstractWe show that equivalence is decidable for D0L systems with finite axiom sets. We discuss also DF0L power series and solve their equivalence problem over computable fields
AbstractWe show that equivalence is decidable for D0L systems with finite axiom sets. We discuss also DF0L power series and solve their equivalence problem over computable fields
AbstractThe definitions of a piecewise deterministic zero Lindenmayer (PWD0L) scheme and system are ...
The language and sequence equivalence problem for DOL-systems is shown to be decidable. In an algebr...
AbstractThe equivalence problem for deterministic pushdown automata is shown to be decidable. We exh...
AbstractWe show that equivalence is decidable for D0L systems with finite axiom sets. We discuss als...
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...
One of the questions of the longest open standing in the area of Lindenmayer-systems is the decidabi...
AbstractThis paper continues the research on elementary D0L systems. In particular we provide an alt...
The decidability of equivalence problems for DOL systems has been studied in various papers. One of...
AbstractWe describe four complete and recursively enumerable formal systems S0,D0,H0,B0. Each one of...
We show that it is decidable whether or not a given D0L power series over a semiring A is A-algebrai...
Abstract: We show that it is decidable whether or not a given D0L power series over a semiring A is ...
Nielsen, Rozenberg, Salomaa and Skyum have shown that HD0L languages are CPDF0L languages. We will g...
AbstractWe show that sequence equivalence, language equivalence, growth equivalence and road equival...
AbstractWe show by a simple argument how any algorithm for solving the D0L language equivalence prob...
AbstractThe definitions of a piecewise deterministic zero Lindenmayer (PWD0L) scheme and system are ...
The language and sequence equivalence problem for DOL-systems is shown to be decidable. In an algebr...
AbstractThe equivalence problem for deterministic pushdown automata is shown to be decidable. We exh...
AbstractWe show that equivalence is decidable for D0L systems with finite axiom sets. We discuss als...
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...
One of the questions of the longest open standing in the area of Lindenmayer-systems is the decidabi...
AbstractThis paper continues the research on elementary D0L systems. In particular we provide an alt...
The decidability of equivalence problems for DOL systems has been studied in various papers. One of...
AbstractWe describe four complete and recursively enumerable formal systems S0,D0,H0,B0. Each one of...
We show that it is decidable whether or not a given D0L power series over a semiring A is A-algebrai...
Abstract: We show that it is decidable whether or not a given D0L power series over a semiring A is ...
Nielsen, Rozenberg, Salomaa and Skyum have shown that HD0L languages are CPDF0L languages. We will g...
AbstractWe show that sequence equivalence, language equivalence, growth equivalence and road equival...
AbstractWe show by a simple argument how any algorithm for solving the D0L language equivalence prob...
AbstractThe definitions of a piecewise deterministic zero Lindenmayer (PWD0L) scheme and system are ...
The language and sequence equivalence problem for DOL-systems is shown to be decidable. In an algebr...
AbstractThe equivalence problem for deterministic pushdown automata is shown to be decidable. We exh...
Add to ORKG