Back to Questions
Computer Science Fundamentals Algorithms Objective
Mar 06, 2013

If Σ = (0, 1), L = Σ* and R = (0n 1n such that  n >  0 ) then languages L ∪ R and R respectively are

Choose the correct answer:
A) Regular, Regular
B) Regular, Not regular
C) Not regular, Not regular
D) both b & c
Detailed Explanation

Option d is right answer.

Discussion (0)

No comments yet. Be the first to share your thoughts!

Share Your Thoughts
Feedback