CFG for the language of all non Palindromes

By: Prof. Fazal Rehman Shamil | Whatsapp:+923028700085

CFG for the language of all non- Palindromes.

Y→aYa|bYb|aZb|bZa
Z→aZ|bZ|ϵ

CFG for the language of all non Palindromes Context Free Grammar

Strings that must be accepted 

We are testing with some of the strings, you can try it on more strings.

Strings of length 1: {no string}

Strings of length 2: {01,10, no morestring}

Strings of length 3: {001, 011, 100, no more strings }

Strings of length 5: {00001, 00011, 00111, 01111, 10000, 11000, 11100, 11110. no more strings }

Strings of length 8: {01001011, ….. and many more similar strings}

Strings that must be rejected 

We are testing with some of the strings, you can try it on more strings.

Strings of length 1: {0, 1}

Strings of length 2: {00,11, no morestring}

Strings of length 5: {10001, 11011, ….. and many more similar strings. }

Video Lecture