COUNTING 2-STATE TRANSITION-TOUR SEQUENCES

Authors
SAXENA NR MCCLUSKEY EJ
Citation
Nr. Saxena et Ej. Mccluskey, COUNTING 2-STATE TRANSITION-TOUR SEQUENCES, I.E.E.E. transactions on computers, 45(11), 1996, pp. 1337-1342
Citations number
13
Categorie Soggetti
Computer Sciences","Engineering, Eletrical & Electronic","Computer Science Hardware & Architecture
Journal title
I.E.E.E. transactions on computers → ACNP
ISSN journal
00189340
Volume
45
Issue
11
Year of publication
1996
Pages
1337 - 1342
Database
ISI
SICI code
0018-9340(1996)45:11<1337:C2TS>2.0.ZU;2-Q
Abstract
This paper develops a closed-form formula, f(k), to count the number o f transition-tour sequences of length k for bistable machines. it is s hown that the function f(k) is related to Fibonacci numbers. Some appl ications of the results in this paper are in the areas of testable seq uential machine designs, random testing of register data paths, and qu alification tests for random pattern generators.