Question

Finite Automata and regular Expression Given the following Finite automata: 1. 0, 1 0, 1 0, 1 What regular expression does it accept?

Answer 1

1)  regular expression:
------------------------
(0+1)(0+1)(0+1)*

Explanation:
-------------
(0+1) -> denotes transition from first state to second state
(0+1) -> denotes transition from second state to third state
(0+1)* -> denotes a self-loop on third state