I'm looking for a FSA (Finite State Acceptor) for all binary strings containing an odd number of 0's. A state diagram is the easiest for me to understand. A valid regular expression to describe the language (I've verified this) is 1*0(1+01*0)*
Thanks!© BrainMass Inc. brainmass.com September 24, 2018, 11:08 pm ad1c9bdddf - https://brainmass.com/computer-science/programming-languages/fsa-finite-state-acceptor-80889
FSA (Finite State Acceptor) is shown.