The problem that I'm having trouble with is the following (please see the attached image before proceeding).
Give a polynomial-time reduction of the equivalence problem for closed arithmetic sequential program to the equivalence problem for probabilistic automaton.
I have thought that maybe and . But now I'm not sure how to proceed. Please help!!