theory of computing
1. Construct a Turing machine that accepts the language L-{ we {a, b, c)’ : n(w)-na(w)+ nb(w) } Draw a diagram of the machine and write out δ-function). 2. Construct a Turing machine to compute the function fw)-ww, where we (a,b (replace the input by function value). (e.g. qoaab м.qf aabbaa ) Show transcribed image text
Expert Answer
An answer will be send to you shortly. . . . .