Theory of computation

“Mealy Machine-II”.

1. Which of the following does not belong to input alphabet if S={a, b}* for any language?
a) a
b) b
c) e
d) none of the mentioned
View Answer

2. The number of final states we need as per the given language?
Language L: {an| n is even or divisible by 3}
a) 1
b) 2
c) 3
d) 4
View Answer

3. An e-NFA is ___________ in representation.
a) Quadruple
b) Quintuple
c) Triple
d) None of the mentioned
View Answer


Sanfoundry Certification Contest of the Month is Live. 100+ Subjects. Participate Now!


advertisement
4. State true or false:
Statement: Both NFA and e-NFA recognize exactly the same languages.
a) true
b) false
View Answer

5. Design a NFA for the language:
L: {an| n is even or divisible by 3}
Which of the following methods can be used to simulate the same.
a) e-NFA
b) Power Construction Method
c) Both e-NFA and Power Construction Method
d) None of the mentioned
View Answer

, Check this: Computer Science MCQs | Computer Science Books


6. Which of the following belongs to the epsilon closure set of a?




a) {f1, f2, f3}
b) {a, f1, f2, f3}
c) {f1, f2}
d) none of the mentioned
View Answer

7. The number of elements present in the e-closure(f2) in the given diagram:




a) 0
b) 1
c) 2