Question 2 If transition is not defined on the current state and the current tape symbol, then the machine A halts B does not halt C […]

Question 3 A language L may not be accepted by a Turing machine if A it is recursively enumerable B L can be enumerated by some […]

Question 4 The variable which produces an epsilon is called A empty B terminal C non-terminal D nullable Question 4 Explanation:  The variable which produces an […]

Question 5 The construction time for DFA having m nodes from an equivalent NFA is A O(m2) B O(2m) C O(m) D O(log m) Question 5 […]