Solved

Consider the Languages: L1 ={A^n B^n C^m | N,m >01

Question 3

Multiple Choice

Consider the languages: L1 ={a^n b^n c^m | n,m >01 and L2 ={a^n b^m c^m |n,m> o)
Which one of the following statements is FALSE?


A) L1 n L2 is a context-free language
B) L1 u L2 is a context-free language
C) L1 and L2 are context-free languages
D) L1 n L2 is a context sensitive language

Correct Answer:

verifed

Verified

Related Questions

Q1: Let SHAM3 be the problem of finding

Q2: S -> aSa| bSb| a| b ;

Q4: Consider the languagesL<sub>1</sub>={0^{i}1^{j}|i != j},L<sub>2</sub>={0^{i}1^{j}|i = j},L<sub>3</sub>

Q5: Let L<sub>1</sub> be a recursive language. Let

Q6: A minimum state deterministic finite automation accepting

Q7: If s is a string over (0

Q8: Consider the following two problems on undirected

Q9: Consider the set of strings on

Q10: For S € (0+1)* let d(s)denote the

Q11: Consider the language L<sub>1</sub>,L<sub>2</sub>,L<sub>3</sub> as given below.<br>L<sub>1</sub>={0^{p}1^{q}