The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.11 - November (1996 vol.45)
pp: 1337-1342
ABSTRACT
<p><b>Abstract</b>—This paper develops a closed-form formula, <it>f</it>(<it>k</it>), to count the number of transition-tour sequences of length <it>k</it> for bistable machines. It is shown that the function <it>f</it>(<it>k</it>) is related to Fibonacci numbers. Some applications of the results in this paper are in the areas of testable sequential machine designs, random testing of register data paths, and qualification tests for random pattern generators.</p>
INDEX TERMS
Transition-tours, sequential machine testing, Fibonacci numbers, checking experiments, testable synthesis.
CITATION
Nirmal R. Saxena, Edward J. McCluskey, "Counting Two-State Transition-Tour Sequences", IEEE Transactions on Computers, vol.45, no. 11, pp. 1337-1342, November 1996, doi:10.1109/12.544493
17 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool