Computer Science Fundamentals Algorithms Objective
Mar 06, 2013

The grammars G = ( { s }, { 0, 1 }, p , s)
where p = (s —> 0S1, S —> OS, S —> S1, S —>0} is a

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

Option b is right answer.

Discussion (0)

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

Share Your Thoughts
Feedback