question 8, please show proof, three different acceptors pda,dfa and turing machine
We were unable to transcribe this image1. L (a”bm |n>m, m> 0 2. L (w |w wR R stands for reversed. 4. L(:na(w) and nb(w) are both divisible by 5 ) 12. L (w na(w) is a perfect square) Show transcribed image text
1. L (a”bm |n>m, m> 0 2. L (w |w
OR
OR