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 ...

Applicable Analysis and Discrete Mathematics, Vol. 10, No. 2 (October 2016), pp. 408-446 (39 pages) An associative Boolean tree is a plane rooted tree whose internal nodes are labelled by AND or OR ...

Presents propositional logic, combinatorics, methods of proof, mathematical systems, algebra of sets, matrix algebra, relations and functions, recursion and generating functions, applications to ...

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

Introduces students to ideas and techniques from discrete mathematics that are widely used in science and engineering. Mathematical definitions and proofs are emphasized. Topics include formal logic ...