is this a Context free Language : L=$L=\{W1W2 | where W1 is not equal to W2 and |W1|=|W2|W_1W_2 \mid W_1 \ne W_2 \: \text{and} \: |W_1|=|W_2|\}$

L={W1W2 | where W1 is not equal to W2 and |W1|=|W2|}$L=\{W_1W_2 \mid W_1 \ne W_2 \: \text{and} \: |W_1|=|W_2|\}$

Alphabet = { a , b }*

Considering L={WW} is not context free, shouldn't this be non context free as well? otherwise can you provide a machine or grammar which accepts this?

Source Link

asked Sep 26, 2017 at 17:06

Richard Jones

307
3
11

is this a Context free Language : L={W1W2 | where W1 is not equal to W2 and |W1|=|W2|}

L={W1W2 | where W1 is not equal to W2 and |W1|=|W2|}

Alphabet = { a , b }*

Considering L={WW} is not context free, shouldn't this be non context free as well? otherwise can you provide a machine or grammar which accepts this?

Stack Exchange Network

Return to Question

is this a Context free Language : L=$L=\{W1W2 | where W1 is not equal to W2 and |W1|=|W2|W_1W_2 \mid W_1 \ne W_2 \: \text{and} \: |W_1|=|W_2|\}$

is this a Context free Language : L={W1W2 | where W1 is not equal to W2 and |W1|=|W2|}

is this a Context free Language : $L=\{W_1W_2 \mid W_1 \ne W_2 \: \text{and} \: |W_1|=|W_2|\}$

is this a Context free Language : L={W1W2 | where W1 is not equal to W2 and |W1|=|W2|}