NPTEL IIT Guwahati

Example: 4 The Moore machine which is equivalent to the Mealy machine given is example 2 is shown below.

The states [q₁,0] & [q₁,1] an be renamed as q₁ & q₃ respectively.


	Some decision properties of Regular Languages	Print this page
	First \| Last \| Prev \| Next
	Example: 4 The Moore machine which is equivalent to the Mealy machine given is example 2 is shown below. The states [q₁,0] & [q₁,1] an be renamed as q₁ & q₃ respectively.

	First \| Last \| Prev \| Next