question 8, please show proof, three different acceptors pda,dfa and turing machine, Note it is not n*6, it is n 6 = m.
Directions Show that the following languages are either regular, context-free or context- sensitive. Remember if a language is regular, it is also context-free and context-sensitive; however
OR
OR