Mumbai University > Computer Engineering > Sem 4 > Theoretical Computer Science

Marks: 10M

Year: Dec 2016

The machine is a mealy machine, so outputs depends on present state and present input.

For input 0, output is 0. Transitional function will be δ (q0, 0)->qo and output function λ is qo X0->0.

For input 1, output 1. Transitional function will be δ (q0, 1)->q1 and output function λ is qo X1->1.

For input 10, output 2. So, transitional function will be δ (q1, 0)->q2 and output function λ is q1 X0->2.

For input 11, output 0. Hence, transitional function will be δ (q1, 1)->q0 and output function λ is q1 X0->0.

By this process all the transactional functions will be constructed.

The mealy machine for this is