Math, asked by singhlavi154, 3 months ago

3. Desigu a transition diagram for a DFA accepting strings generated over I {0.1)
having three states one starting state, two final states) and two moves from each state
Derive the regular expression for the diagram.​

Answers

Answered by msavith
0

Answer:

sjf9iajbxufkwkbfturowlnbfhsokbfvgeianc

Similar questions