1 votes 1 votes Answers given in test series are as follows: 1)B 2)D 3)B 4)B Ps: I posted all these 4 question in one because i thought most of them are erroneous so better to make one thread! Theory of Computation theory-of-computation + – saxena0612 asked Dec 22, 2017 • edited Dec 22, 2017 by saxena0612 saxena0612 716 views answer comment Share Follow See all 14 Comments See all 14 14 Comments reply Show 11 previous comments joshi_nitish commented Dec 22, 2017 reply Follow Share @Kiran prefix-L is a language obtained by taking all the prefixes of all the possible strings in a language. for eg: L ={a, ab, baa} then prefix L = {eps, a, ab, b, ba, baa} 1 votes 1 votes Raj Kumar 7 commented Dec 23, 2017 reply Follow Share plz, explain question number 3. 0 votes 0 votes Raj Kumar 7 commented Dec 23, 2017 reply Follow Share in question number 4, the string contains exactly 2 a's and 4 b's then there exist only one string i.e. (aabbbb), it needs only 8 states. Am I right? plz explain if I am wrong. 0 votes 0 votes Please log in or register to add a comment.