Home > Theory Of Computation > Construct Minimal DFA That Accepts All The Strings Of 0’s & 1’s Who’s Integer Equivalent Is ≅ 0 Mod 5

Construct Minimal DFA That Accepts All The Strings Of 0’s & 1’s Who’s Integer Equivalent Is ≅ 0 Mod 5

Construct Minimal DFA That Accepts All The Strings Of 0’s & 1’s Who’s Integer Equivalent Is ≅ 0 Mod 5

Given Σ={0,1}

In This Problem, We Are Going To Convert Binary Into Integer.

(1010)2

=(0×20+1×21+0×22+1×23)

=0+2+0+8=(10)10

The Possible Remainders

 

One thought on “Construct Minimal DFA That Accepts All The Strings Of 0’s & 1’s Who’s Integer Equivalent Is ≅ 0 Mod 5

Leave a Reply