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

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

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

Given Σ={0,1}

(1000)2=(8)10

// 1000 is binary number, 2 is base of 1000, 8 is decimal integer & 10 is base of 8.

If This Is Divisible By ‘4’, Then It Goes To Final State, If Not ‘no’

First Thing You Have To Do Is, You Have To Find All Possible Remainders

All Possible Remainders Are

You Should Not Create FA Directly, You Have To Create Transition Table First.

Given Is Divisible By “4” Means Remainder Should Be ‘0’, In Which State We Are Getting ‘0’

At qThe Remainder We Got Is ‘0’, So qWill Be Your Final State.

To Fill The Transition Table, You Need To Follow The Rythm Technique.

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

  1. certainly like your website but you have to take a look at the spelling on several of your posts. Many of them are rife with spelling issues and I find it very troublesome to inform the reality then again I will definitely come back again.

Leave a Reply