1 votes 1 votes Read the informal definition of the finite state transducer given in Question $24.$ Prove that $\text{no FST}$ can output $w^{R}$ for every input $w$ if the input and output alphabets are $\{0,1\}.$ Theory of Computation michael-sipser theory-of-computation finite-automata finite-state-transducer proof descriptive + – admin asked Apr 30, 2019 admin 191 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.