I PRIKLADNAYA MATEMATIKA
(FUNDAMENTAL AND APPLIED MATHEMATICS)
1996, VOLUME 2, NUMBER 4, PAGES 1029-1043
A. A. Zamyatin
A. A. Yambartsev
View as HTML View as gif image
A finite string is just a sequence of symbols from finite alphabet.
We consider a Markov chain with the state space equal to the set of
all pairs of strings.
Transition probabilities depend only on
We consider the case when dynamics of Markov chain is transient, i.e.
|Main page||Contents of the journal||News||Search|
Last modified: March 19, 2005