Abstract:
It is shown that a single-output Moore-type n-state linear machine may be realized with no more than 2n copies of the AND–OR-delay (AOD) module of Newborn, Weiner, and Ho...Show MoreMetadata
Abstract:
It is shown that a single-output Moore-type n-state linear machine may be realized with no more than 2n copies of the AND–OR-delay (AOD) module of Newborn, Weiner, and Hopcroft. This bound is significantly lower than that for arbitrary single-output Moore-type machines, which is 2n.
Published in: IEEE Transactions on Computers ( Volume: C-20, Issue: 12, December 1971)
