Question: Suppose that a language L Subsetequalto {a, b}*is defined as follows: (1) epsilon elementof L, (2) If x, y elementof L, then so are axby

Suppose that a language L Subsetequalto {a, b}*is defined as follows: (1) epsilon elementof L, (2) If x, y elementof L, then so are axby and bxay. (3) Nothing else is in L. Prove by induction that strings in L have the same number of a"s and b"s
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
