CS402 3 Theory of Automata assignment solution fall December 2011

Total Marks= 20 (5+5+5+5)

Question No.1

1. Convert Moore machine given below in corresponding Mealy machine.

1. Run strin abbbba on this machine and corresponding Mealy machine by showing complete process and confirm that both machines generate same outputs (ignoring extra character of Moore machine).

Input		a	b	b	b	b	a
Status	qo	q1	q4	q4	q4	q4	q4
Moore	0	0	0	0	0	0	0
Mealy		0	0	0	0	0	0

Question No.2

1. Convert following Mealy machine into corresponding Moore machine.

1. Run string bbaaba on this machine and corresponding Moore machine by showing complete process and confirm that both machines generate same outputs (ignoring extra character of Moore machine).

Input		b	b	a	a	b	a
Status	qo	q3	q3	q3	q3	q3	q3
Mealy		1	1	1	1	1	1
Moore	1	1	1	1	1	1	1