Is this language context free?

From: "Dillon" <dillongeo@xxxxxxxxx>
Date: Sun, 13 Jul 2008 10:09:22 -0500

Hi,

This is a problem I have been working on for a while:

Consider the following language L over the alphabet {a, b, c}. L = {xyz | x
= y^R, z is a string with only c's, and lx|¡Ù lzl }. Here y^R denotes the
string obtained by reversing y.

Is L context free?

Thanks!
Dillon

.

Follow-Ups:
- Re: Is this language context free?
  - From: Chris Smith

Prev by Date: Re: Rice's theorem
Next by Date: TAUTOLOGY and SAT
Previous by thread: NP problem and co-NP problem
Next by thread: Re: Is this language context free?
Index(es):
- Date
- Thread