3. (40 pts) The Following is an example of a weighted PSA: Each transition is la

Question

3. (40 pts) The Following is an example of a weighted PSA: Each transition is labeled with an input symbol and a weight. The cost of a path is the sum of the weights of each transition in the path. For example, the state sequence 0 right arrow 1 right arrow 2 right arrow 1, corresponding to the input sequence aba, would have the cost 2+ 2 + 2 = 6. (a) Applying the Viterbi algorithm by hand, find the cheapest (i.e., lowest summed weights) state sequence in this machine for the input sequence ababa. Include the complete trellis with your answer.

Explanation / Answer

The lowest summed weights for ababa = 2+2+2+1+1 = 8

Related Questions

Navigate

• Browse (All)
• Browse 3
• Subjects

---

---

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.