Let T denote a subset of the possible transitions between the states of a finite Markov chain and let Yk denote the time of the kth occurrence of a T-transition. Formulae are derived for the ...

Description: The course covers mathematics useful in analyzing computer algorithms. Topics include recurrence relations, evaluation of sums, integer functions, elementary number theory, binomial ...

This is a preview. Log in through your library . Abstract The paper contains a simple, direct derivation of the generating functions for a class of permutations generalizing the up-down permutations.