Question 3 (1 point) Consider a DFA in which there is only one final state. There is one path leading from the initial s

[answerhappygod]

Question 3 1 Point Consider A Dfa In Which There Is Only One Final State There Is One Path Leading From The Initial S 1 (38.38 KiB) Viewed 48 times

Question 3 (1 point) Consider a DFA in which there is only one final state. There is one path leading from the initial state to the final state and 2 simple cycles from this final state. Below is a table with regular expressions corresponding to these: path and cycles. What is the regular expression describing the language of this automaton? Final State 9 Paths baa b baa b((ba b) u (ab aa b)") (baa b) (babu ab aa b) Ob aa b(ba b) (ab aa* b) Ob aa b(ba' bu ab aa b) Cycles bab, ab aa b Regular Expression ?