Question: A palindrome is a string that is equal to its reverse ( i . e . it reads the same forward and backward, for example

A palindrome is a string that is equal to its reverse (i.e. it reads the same
forward and backward, for example the strings 0,11,101,1001 are palindromes). Prove that the set of binary strings that are palindromes is not a regular language.

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Databases Questions!