Issue No. 11 - November (1996 vol. 45)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/12.544493
<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>
Transition-tours, sequential machine testing, Fibonacci numbers, checking experiments, testable synthesis.
Nirmal R. Saxena, Edward J. McCluskey, "Counting Two-State Transition-Tour Sequences", IEEE Transactions on Computers, vol. 45, no. , pp. 1337-1342, November 1996, doi:10.1109/12.544493