Let Σ={0,1} be an alphabet for information sources. Assume that irreducible and aperiodic Markov information sources S1 and S2 consisting of finite numbers of states satisfy:
[C1] neither S1 nor S2 outputs any sequence including 11, and
[C2] S2 does not output any sequence including 0000.
Answer all of the following subquestions from (1) to (5).
(1) Let s1,s2,…,sm be the states of S1.
Draw the transition diagram of S1.
Assume that S1 should output 0 with probability p (0<p<1) when it is at state s1. You must make the number of the states m minimum.
(2) Let t1,t2,…,tn be the states of S2. Draw the transition diagram of S2.
Assume that S2 should output 0 with probability p (0<p<1) when it is at state t1 and with probability q (0<q<1) when it is at state t2.
You must make the number of the states n minimum. Also explain the reason why your answer satisfies [C1] and [C2].
(3) Give the transition matrix of S2.
(4) Let a probability distribution (q1,…,qn)(0≤qi≤1,q1+⋯+qn=1) be on the states (t1,…,tn).
When the distribution is stationary and p=q, represent each of q1,…,qn with p.
(5) Show the entropy of S2 with p when the initial distribution is equal to the stationary distribution given in (4).