Question: ( please dont use AI for solving ) Consider the language L of those words matched by a ( ba ) that contain twice as
please dont use AI for solving Consider the language L of those words matched by aba that contain twice as many as as bs eg
aba, aababa are accepted, but not aaba or baa Show that this language is not regular.
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
