Question 1 If L and ~L (complement of L) are recursive enumerable, then L is A regular B context free C context sensitive D recursive Question […]

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 […]