Question: please help? 1. Let L be the language over the alphabet {a,b} that consists of all strings that have even length or contain no more
please help?
1. Let L be the language over the alphabet {a,b} that consists of all strings that have even length or contain no more than two a's. a) Give a regular expression for the language L (b) Give an NDFA for that language (c) Give a DFA for that language
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
