If ? ={0,1} and L = {1nx1n| n ? 1,x??* } show that L is a reqular language.
Expert Answer
An answer will be send to you shortly. . . . .
If ? ={0,1} and L = {1nx1n| n ? 1,x??* } show that L is a reqular language.
An answer will be send to you shortly. . . . .