How to prove "Cfls are not closed under shuffling"

From: "hamperhd@xxxxxxxxx" <hamperhd@xxxxxxxxx>
Date: 14 Apr 2007 10:20:38 -0700

Hi,

Anyone have some hints or links talking about how to prove the
following claim?

"context-free languages are not closed under shuffle operation"

thanks,

.

Follow-Ups:
- Re: How to prove "Cfls are not closed under shuffling"
  - From: filippobollini

Prev by Date: Re: Man beaten by machine in drawing a thumbnail
Next by Date: Re: How to prove "Cfls are not closed under shuffling"
Previous by thread: Man beaten by machine in drawing a thumbnail
Next by thread: Re: How to prove "Cfls are not closed under shuffling"
Index(es):
- Date
- Thread