2 votes 2 votes Theory of Computation turing-machine theory-of-computation + – Mahesha999 asked Jan 1, 2017 Mahesha999 483 views answer comment Share Follow See 1 comment See all 1 1 comment reply santhoshdevulapally commented Jan 2, 2017 reply Follow Share consider a string in the language =aabbcc. first 'a' make it as X and 'b' make it as Y and 'c' make it as Z. =XaYbZc. at state D transtion p=(X,X,R) then repeat same procedure. =XXYYZZ. at state A transition Q=(Y,Y,R) goto state E and skip Y's and Z's it accept. hence P=(X,X,R) AND Q=(Y,Y,R) 1 votes 1 votes Please log in or register to add a comment.