Hey there guys! So I recently decided to take a CS course. One of my HW questions asks me to form a regular expression given a DFA. Now I have actually never ran into DFA's before but I do have some experience with finite state machines. My question is this: Is the regular expression formed from a DFA the same thing as the output logic of a finite state machine?