Explore BrainMass
Share

FSA (Finite State Acceptor)

This content was STOLEN from BrainMass.com - View the original, and get the already-completed solution here!

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!

© BrainMass Inc. brainmass.com October 24, 2018, 7:51 pm ad1c9bdddf
https://brainmass.com/computer-science/programming-languages/fsa-finite-state-acceptor-80889

Solution Summary

FSA (Finite State Acceptor) is shown.

$2.19