By Topic

Counting two-state transition-tour sequences

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Saxena, N.R. ; Center for Reliable Comput., Stanford Univ., CA, USA ; McCluskey, E.J.

This paper develops a closed-form formula, f(k), to count the number of transition-tour sequences of length k for bistable machines. It is shown that the function f(k) 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

Published in:

Computers, IEEE Transactions on  (Volume:45 ,  Issue: 11 )