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

The language L = (0n 1n 2n where n > 0) is a

Choose the correct answer:
A) context-free language
B) context-sensitive language
C) regular language
D) recursive enumerable language
Detailed Explanation

Option b is right answer.

Discussion (0)

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

Share Your Thoughts
Feedback