Existence Algorithms for Synchronizing/Distinguishing Sequences

  • Authors:

  • Sung Je Hong

  • Affiliations:

  • Department of Computer Science, University of Illinois

  • Venue:
  • IEEE Transactions on Computers
  • Year:
  • 1981

Quantified Score

Hi-index 14.98

Visualization

Abstract

This correspondence describes two efficient algorithms for determining whether or not a given finite-state machine has a synchronizing sequence and a distinguishing sequence, respectively, and compares them with the well-known tree method. Compared with the tree method, these new algorithms are easier to implement and require less memory size. Since they do not require keeping and searching a look-back directory, they allow significant speed improvements.