• recategorized by
6,471 views

4 Answers

Best answer
43 43 votes

No intersection of two CFLs may or may not be a CFL i.e. CFL is not closed under intersection operation.

Example:

  • $L_1: \{ a^nb^nc^m| n,m >=1 \} \cap L_2: \{ a^nb^mc^m | n,m >=1 \}$
  • $L_3= \{ a^mb^mc^m | m >=1 \}$,  which is CSL.
• edited by
0 0 votes

FALSE,  as CFL’s are not closed under intersection operation and hence intersection of two CFL’s may or may not be a CFL. It could be CSL also.

Answer:
Position:
Show:

Related questions

19 19 votes
5 answers 5 answers
7.0k
7.0k views
Misbah Ghaya asked Nov 9, 2016
6,953 views
State whether the following statements are TRUE or FALSE:The problem as to whether a Turing machine $M$ accepts input $w$ is undecidable.
21 21 votes
5 answers 5 answers
6.8k
6.8k views
Misbah Ghaya asked Nov 9, 2016
6,843 views
State whether the following statement are TRUE or FALSE.$A$ is recursive if both $A$ and its complement are accepted by Turing machines.
18 18 votes
2 answers 2 answers
4.7k
4.7k views
Misbah Ghaya asked Nov 9, 2016
4,728 views
State whether the following statements are TRUE or FALSE:All subsets of regular sets are regular.
22 22 votes
5 answers 5 answers
6.4k
6.4k views
Misbah Ghaya asked Nov 9, 2016
6,415 views
State whether the following statements are TRUE or FALSE:Regularity is preserved under the operation of string reversal.