Answer to Question #38166 in Math for Sujata Roy

Question #38166

Consider the languages
L1= {a^n b^n c^m | n,m > 0} and L2= {a^n b^m c^m | n,m > 0}

(A) L1 intersection L2 is a context-free language
(B) L1 union L2 is a context-free language
(C) L1 and L2 are context-free language
(D) L1 intersection L2 is a context sensitive language

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. What is the language {a^m b^(m+n) | m,n >= 1} ? Explain. (A) regular (B) context-free but not re
2. Which of the following are decidable? 1. Whether the intersection of two regular languages is infini
3. Which of the following is true for the language{a^P | P is a prime} and why? (A) It is not accepted
4. Which of the following languages is regular? (A) {WW^R |W belongs to {0,1}^+} (B) {WW^RX | X,W belo
5. The language L = {0^i 21^i | i <= 0} over the alphabet {0,1,2} is (A) not recursive (B) is recurs
6. If the entire program is written in FORTRAN, the percentage increase in the execution time, compared
7. To completely write the program in FORTRAN and rewrite the 1% code in assembly language, if the proj