How are strings accepted in a finite automata?

Strings containing ‘a’ as the alphabet. In the above transition diagram, as we can see that initial state ‘Y’ on getting ‘b’ as the input it remains in the state of itself and on getting ‘a’ as the input it transits to a final state ‘Z’ and so on for the remaining states. Thus this FA accepting all the strings of the given RE language.
For More Information Please Refer:


You May Also Like to Read: