a) Draw a state diagram for a Turing Machine to recognize Language bb* , where S={b}. Explain
No answer yet for this question.
Ask a Tutor
Question:
a) Draw a state diagram for a Turing Machine to recognize Language bb* , where S={b}. Explain how your TM works and why it is correct. Define your designed TM formally by expressing its tuple parts. b) Now let the input string be bbbb . Run your machine on this input and show step by step how this string is accepted by your TM.
Posted Date: