Answer to Question #38653 in Math for Sujata Roy

Question #38653

A language denoted by extended regular expressions which is regular expressions with the operations of intersection and complementation is
A. regular
B.deterministic context-free but not regular
C. context-sensitive but not context-free
D. type 0 but not context sensitive

Expert's answer

Download Answer

Learn more about our help with Assignments: Math

Comments

No comments. Be the first!

Leave a comment

Related Questions

1. A language denoted by a semi-extended regular expression which is regular expression with the additi
2. The languge {0^1 1^j|gcd(i,j)=1} is A. regular and not infinite B. context-free but regular C. conte
3. The language {0^p|p not prime} is A. regular and finite B. context-free but regular C. context-sensi
4. The language {a^ceil(log2n)|n>=1} is A. regular and also deterministic context free B. context-fr
5. The language {a^i b^j c^k|i+j>=k} is A. regular but not finite B. context-free but not regular C.
6. The language {a^i b^j c^k|i<j<k} is A. regular but not finite B. context-free but not regular
7. The language {a^i b^j c^k| k= max(i,j)} os A. regular but not context-free B. context-free but not r