Finite automata and Transducers
I'm trying to understand the formating for graphing out transducers and I'm not sure where looping back to existings states is acceptable or not.
The homework example involves converting 3 digit binary numbers to gray code. The model answer given is depicted more like a binary tree that loops back from the end points back to the root. Making use of 6 total states.
Where as the answer I came up with only uses two states and transitions that allow states to loop back to themselves. Is this not acceptable? Since it seems to be the convention with other finite automata.
u/According_Cheek_924 — 13 days ago