Question: 5. Consider the language, L, using the alphabet A = {a, , y} defined by: a word w is in L if and only

5. Consider the language, L, using the alphabet A = {a, , y} defined by: a word w is in L if and only if the number of a's times the number of 's equals the number of y's. So yaay is in L but ayayy is not. Is this language regular or not? Explain your reasoning clearly. 6. Consider the language, L, using the alphabet A - {a, ,y} defined by: a word w is in L if and only if the number of a's, 's and the number of y's are all odd numbers. So yyay is in L but ayayy is not. Is this language regular or not? Explain your reasoning clearly.
Step by Step Solution
There are 3 Steps involved in it
To determine if this language L2 is regular or not we need ... View full answer
Get step-by-step solutions from verified subject matter experts
