Are the following languages regular languages or not ? Justify your answer with a proof.
If it is regular , give an automata , if it is not justify with a pumping lemma
SOLUTION-
IF YOU HAVE ANY DOUBT PLEASE COMMENT DOWN BELOW I
WILL SOLVE IT FOR YOU:)
----------------PLEASE RATE THE ANSWER-----------THANK
YOU!!!!!!!!----------
Get Answers For Free
Most questions answered within 1 hours.