Draw a transition state diagram of (a) a non-enzymatic reaction... | Filo

3. [15 pts] Draw a state transition diagram for the FA of regular language L(r) wherer = (a b)*a4. [15 pts] Write a regular expression for the language L using alphabet a, b where all strings inthe language start with a single b, followed by any number of a's (including none), and end in asingle a.5. [20 pts] Draw the state transition diagram for the finite automaton that models the regularexpression b*ab(a b)*

State Transition Tables