(a) Using Arden's theorem, construct a regular expression for the tra…

Question

(a) Using Arden's theorem, construct a regular expression for the transition diagram given below : (10)

(b) Convert the given Mealy machine into Moore machine : (10)

| State | Input $a = 0$ | Input $a = 1$ |

|---|---|---|---

| | State | Output | State | Output |

| $\rightarrow q_1$ | $q_3$ | $0$ | $q_2$ | $0$ |

| $q_2$ | $q_1$ | $1$ | $q_4$ | $0$ |

| $q_3$ | $q_2$ | $1$ | $q_1$ | $1$ |

| $q_4$ | $q_4$ | $1$ | $q_3$ | $0$ |

Related pages

• Conversion and Equivalence of Moore and Mealy Machines — topic
• Theory of Computation syllabus

More PYQs on Conversion and Equivalence of Moore and Mealy Machines

• a) Construct NFA for the Regular exp $((a+b)^*aa)^*$ b) State and prove the equivalence of Moore machine and Mealey machine?
• Define Mealy and Moore Machine. Explain the process of converting Mealy to Moore Machine.