Question 7. Let L be the language of all strings a € {a,b,c}' such that ala-10= 2, i.e., the the number a's in a minus t
Posted: Sun May 15, 2022 1:07 pm
please solve as soon as possible according to the above
conditions given in question
Question 7. Let L be the language of all strings a € {a,b,c}' such that ala-10= 2, i.e., the the number a's in a minus the number of b's must be equal to 2. (Hence, for all strings a in the number of a's, must be larger than the number of b's.) Design a deterministic Turing machine that accepts L. [10 marks)
conditions given in question
Question 7. Let L be the language of all strings a € {a,b,c}' such that ala-10= 2, i.e., the the number a's in a minus the number of b's must be equal to 2. (Hence, for all strings a in the number of a's, must be larger than the number of b's.) Design a deterministic Turing machine that accepts L. [10 marks)