Question: Problem 2 . ( 6 points ) Consider the language formed by strings over the alphabet = { a , b } of even length
Problem points
Consider the language formed by strings over the alphabet of even length whose two halves are equal, ie
Prove that there is no finite automaton FA that can accept this language by showing that if there were such a FA having states, it would not satisfy the Pumping Lemma.
Step by Step Solution
There are 3 Steps involved in it
1 Expert Approved Answer
Step: 1 Unlock
Question Has Been Solved by an Expert!
Get step-by-step solutions from verified subject matter experts
Step: 2 Unlock
Step: 3 Unlock
