PadhaikoAll subjects

Past exam question: 2082 Kartik (Back), Q2(b)(ii)

Theory of Computation · 1 marks

Open in the Padhaiko app

Topic: Finite State Machines & DFA Design

Question

Verify your design using suitable example.

Solution

Execution Verification of Designed DFA on Positive and Negative Examples: We verify the 4-state parity DFA on test strings over :

Positive Example: (2 zeros, 1 one Even 0s, Odd 1s)

Since is the accept state, is correctly accepted.

Negative Example: (2 zeros, 2 ones Even 0s, Even 1s)

The machine terminates in non-accepting state , correctly rejecting .

Answer:

Tracing yields (accepted), while yields (rejected), confirming correct operation.

All past exam questions for Theory of Computation