Autonomous Clocks in Sequential Machines

Research output: Contribution to journalLetterpeer-review

3 Scopus citations


A necessary and sufficient condition for the existence of an autonomous clock in a sequential machine M is found to be the existence of a nontrivial input-independent partition on the set of internal states of M, no matter whether M is completely specified or incompletely specified. Two different techniques are given for generating the smallest input-independent partition π1, from which all other input-independent partitions can be obtained. One is suitable for a sequential machine whose state behavior is specified in the form of a flow table, while the other is convenient for a sequential machine whose state behavior is specified in the form of a connection matrix. Both techniques are efficient, and give all possible assignments to the redundant conditions of an incompletely specified sequential machine to reach the same nontrival input-independent partition, and hence the same autonomous clock. COPYRIGHT

Original languageEnglish (US)
Pages (from-to)467-472
Number of pages6
JournalIEEE Transactions on Electronic Computers
Issue number3
StatePublished - Jun 1965
Externally publishedYes

ASJC Scopus subject areas

  • Software
  • Theoretical Computer Science
  • Hardware and Architecture
  • Computational Theory and Mathematics


Dive into the research topics of 'Autonomous Clocks in Sequential Machines'. Together they form a unique fingerprint.

Cite this