Which of the following three statements are true? Prove your answer. (i) The…

PYQ GATE 1992

Which of the following three statements are true? Prove your answer.

(i) The union of two recursive languages is recursive.

(ii) The language {0ⁿ | n is a prime} is not regular.

(iii) Regular languages are closed under infinite union.

Sign up free to check your answer

Sign up free

Explore the full course: Zero To Hero

Loading lesson…