Design DFA for the following languages L={ w |w is any string except a & b} over ∑={a,b}

SOLUTION:

∑={a,b}

Ø  So DFA can be Q={ q₀ , q₁ },∑={a,b }, q₀={ q₀},F={ q₀ } and δ is given by the table

1)Transition diagram:

   2)Transition Table:

Present State	Next State
	Input a	Input b
à *q0	q1	q1
q1	q1	q1

  3)Transition function:

δ( q₀, a)= q₀     ,δ (q₀,b)= q₀   

                        δ( q₁, a)= q₁     ,δ (q₁,b)= q₁