Hello fellow mathematicians/computer-scientists!(adsbygoogle = window.adsbygoogle || []).push({});

I have a question:

If a subset of a language is not context free, does that mean the language itself is not context-free?

For example, I want to show that the following is not context free, using the pumping lemma:

L = {[itex]\omega[/itex] [itex]\in[/itex] {a,b,c}* | [itex]\omega[/itex] has an equal # of a's, b's, and c's}

And since T ={[itex]a^{n}b^{n}c^{n}[/itex] | n [itex]\geq[/itex] 0} [itex]\subset[/itex] L

If I show that T is not context free, does that show that L is not context free?

**Physics Forums - The Fusion of Science and Community**

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

# Context Free Languages, Pumping Lemma

Loading...

Similar Threads - Context Free Languages | Date |
---|---|

Meaning of PDFs in the context of statistics | Jan 31, 2013 |

Log-Likelihood ratio in the context of natural language processing | Nov 27, 2011 |

On-time, In-full & error-free | Jun 10, 2008 |

Free vector space | Apr 13, 2008 |

How much choice for free ultrafilters? | Jul 26, 2007 |

**Physics Forums - The Fusion of Science and Community**