It is shown that to test whether two DOL sequences in the binary case coincide it is enough to test whether four first words of these sequences are the same ...
The DOL sequence equivalence problem is the problem of whether there exists or not an algorithm to decide the equivalence of two given DOL systems. In this ...
Oct 22, 2005 · It is shown that to test whether two DOL sequences in the binary case coincide it is enough to test whether four first words of these ...
The DOL sequence equivalence problem is the problem of whether there exists or not an algorithm to decide the equivalence of two given DOL systems. In this ...
[PDF] On the Equivalence Problem for Binary DOL Systems ...
www.semanticscholar.org › paper › On-t...
A new algorithm is presented for the DOL sequence equivalence problem which, when the alphabets are fixed, works in time polynomial in the rest of the input ...
The language and sequence equivalence problem for DOL-systems is shown to be decidable. In an algebraic formulation the sequence equivalence problem for ...
The crucial property of pairs of DOL systems for the proof of ordinary DOL equivalence is that each pair of sequence equivalent systems has. "bounded balance".
L. G. Valiant, The Equivalence Problem for DOL Systems and its Decidability for Binary Alphabets, Manuscript, 1975.
The Ultimate Equivalence Problem for DOL Systems. - ResearchGate
www.researchgate.net › ... › Systems
Oct 22, 2024 · The ultimate equivalence problem for DOL systems is shown to be recursively decidable. In algebraic formulation this problem can be stated ...
To test the equivalence of two binary D0L sequences it su/ces to compare the first four terms of the sequences. We introduce a larger class of D0L systems for ...