On the equivalence problem for binary DOL systems
Part of the Lecture Notes in Computer Science book series (LNCS, volume 140)
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 result is optimal.
KeywordsEquivalence Problem Correct Ratio Binary Case Free Monoid Finite Alphabet
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Unable to display preview. Download preview PDF.
© Springer-Verlag Berlin Heidelberg 1982