L1 = Set of all strings that start with ‘0’
= {0, 00, 01, 000, 010,…….}
Let’s make a state diagram for this problem

Here
- A is known as an initial state
- B is known as the final state, and
- C is known as dead or trap state
Â
Let’s make a string 001 using the above state diagram
