Stationarity on Finite Strings and Shift Register Sequences
Zaman, Arif
Ann. Probab., Tome 11 (1983) no. 4, p. 678-684 / Harvested from Project Euclid
Stationarity is a property of infinite sequences of random variables. An appropriate extension of this definition is made, to cover finite sequences. The set of finite stationary sequences is shown to be a convex set and its extreme points are related to shift register sequences (which are paths on a graph known as the shift net, or the de Bruijn graph). The set of finite stationary sequences as defined here is simply the set of finite dimensional projections of infinite stationary sequences.
Publié le : 1983-08-14
Classification:  Shift invariance,  extreme points,  de Bruijn graphs,  shift registers,  60G10,  05C38
@article{1176993512,
     author = {Zaman, Arif},
     title = {Stationarity on Finite Strings and Shift Register Sequences},
     journal = {Ann. Probab.},
     volume = {11},
     number = {4},
     year = {1983},
     pages = { 678-684},
     language = {en},
     url = {http://dml.mathdoc.fr/item/1176993512}
}
Zaman, Arif. Stationarity on Finite Strings and Shift Register Sequences. Ann. Probab., Tome 11 (1983) no. 4, pp.  678-684. http://gdmltest.u-ga.fr/item/1176993512/