Question: 1. Construct a DF A that will accept the language L(aa*+ abab). 2. If L' = L(ab*a) and L,-L(ab)ba), find a DFA for the union
1. Construct a DF A that will accept the language L(aa*+ aba"b). 2. If L' = L(ab*a") and L,-L(ab)"ba), find a DFA for the union of Li an 3. Consider this Generalized Transition Graph: O- b 6 a Find an equivalent GTG with only two states by removing the middle state
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
