Question

Construct a PDA that matches all strings in the language over {x,y} such that each string begins and ends with the same symbol. Submit Below, give a short description of the set of strings associated with each state of your PDA ?

Answer 1

Answer-

Given:-

1. So the strings in language over (x,y).
2. Here string starts and terminates which has the same symbol.
3. The PDA is drawn below:-

2. a2 티지 at2 b지 bz2 LG 티지 Car 이지

SO the steps are:-

• 1-2-3 are for the strings that start and end with a.
• 1-4-5 are for the string for b.
• 1-2 first a, any b's and except for last a 2-3.
• 1-4 first b, any a's and except for last b 4-5 .

Now accept it if string is read completely and first and last letters match.