QUESTION 17 Which of the following strings can't be generated by the grammar S-> bs | T T-> aT | CT | A O acaaca Obbacac
Posted: Sun Jul 10, 2022 11:25 am
QUESTION 17 Which of the following strings can't be generated by the grammar S-> bs | T T-> aT | CT | A O acaaca Obbacac Oacbacb b QUESTION 18 Below are the transition rules of a Turing Machine (0 is the start state). (0.a.b.R.0) (0,b,a,R.0) (0.A.A.S.Halt) if the input string 'bbbaaa' is placed on the tape, how many b's will be on the tape after the Turing Machine processes the string and halts? 01 05 02 0 3