Share
Explore BrainMass

FSA (Finite State Acceptor)

Hi,

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!

Solution Summary

FSA (Finite State Acceptor) is shown.

$2.19