Consider the following language,
L={a^p ,b^m ,a^3m ,b^2p, where p, m>=1) where {= (a,b)
(1) Construct a Turing Machine that accepts 'L' (ii) Demonstrate the functionality of TM for the input "abaaabb" with the instantaneous description of the TM for every symbol of the given input.
Already registered? Login
Not Account? Sign up
Enter your email address to reset your password
Back to Login? Click here