Question

Consider the following statement:
l. Over the unary alphabet, every Context Free Language is Regular.
ll. Over the unary alphabet, every Context Sensitive Language is Regular.
Which of the following is the most suitable choice for the above two statement?

• A. Both l and ll are true
• B. l is false, ll is true
• C. l is true, ll is false
• D. None of these

Answer 1

The correct option is C l is true, ll is false

l is true. You can try to make any context free Language over the unary alphabet and every Language you make will end up becoming regular.
For example, the language of palindromes over unary is also regular. But note that ll is false, because for example, (ll is prime) is a non regular CSI,,

So the correct choice is option (b)