Question: Need help with both Regular expression and Finite Automata. 9. 6 Give REs and FAs with alphabet (a, b for a) All strings containing the
9. 6 Give REs and FAs with alphabet (a, b for a) All strings containing the substring aaa b) All strings not containing the substring aaa c) All strings that do not end with aaa d) All strings with exactly 3 a's. e) All strings with the number of a's divisible by 3
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
