Waiting for answer This question has not been answered yet. You can hire a professional tutor to get the answer.
QUESTION
in in O 6 ( 8 pt ) . Consider the language [ = $6 a b / 1 2 0 %. ( 1 ) Design a Turing Machine M, such that given a string WE (a...
Thank youu!!Thank youu!!Thank youu!!Thank youu!!Thank youu!!
ininO6 ( 8 pt ) . Consider the language [ = $6 " a " b" / 1 2 0 %.( 1 ) Design a Turing Machine M, such that given a string WE (a , b ;" , it accepts w if WE L:and reject otherwise .( 2 ) Use Pumping Lemma of CFLS to proof that I is not a CFL .