Question: Viterbis algorithm for the casino dice decoding problem. Find a sequence of (at least 6) digits and compute the maximum probability of a sequence of

Viterbis algorithm for the casino dice decoding problem. Find a sequence of (at least 6) digits and compute the maximum probability of a sequence of states to generate these digits in which there is at least one switching between the two states. Build the dynamic programming table for the maximum probability computation and possible another table for tracing the used states.
0.95 0.9 1: 1/6 2: 1/6 3: 1/6 4: 1/6 5: 1/6 6: 1/6 1: 1/10 0.05 2:1/10 3: 1/10 4: 1/10 0.1 5: 1/10 6: 1/2 Fair Loaded 0.95 0.9 1: 1/6 2: 1/6 3: 1/6 4: 1/6 5: 1/6 6: 1/6 1: 1/10 0.05 2:1/10 3: 1/10 4: 1/10 0.1 5: 1/10 6: 1/2 Fair Loaded
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
