Home > Theory Of Computation > Complement Of Finite Automata(DFA Example): Construct The Minimal Final Automata That Accepts All The Strings Of a & b Where No Of a’s In String Is Not Divisible By 4

Complement Of Finite Automata(DFA Example): Construct The Minimal Final Automata That Accepts All The Strings Of a & b Where No Of a’s In String Is Not Divisible By 4

Sai Charan PalojuJanuary 9, 2019 Theory Of Computation 3

Construct The Minimal Final Automata That Accepts All The Strings Of a & b Where No Of a’s In String Is Not Divisible By 4

Finite Automata (Or) Machine (M)

Divisible By 4

Complement Of Finite Automata (Or) Complement Of M1

Not Divisible By 4

Just Make All Finite States To Non-Final States And Make Final To Non-Final States.

 

Sai Charan Paloju

Related Articles

Part 2: Theory Of Computation Practice Questions

DFA Example : Construct The Minimal Finite Automata That Accepts All Base 8 Numbers Which Are Divisible By ‘6’

DFA Example : Minimization Of DFA Example 2

3 thoughts on “Complement Of Finite Automata(DFA Example): Construct The Minimal Final Automata That Accepts All The Strings Of a & b Where No Of a’s In String Is Not Divisible By 4”

  3. Yesterday, while I was at work, my sister stole my iphone and tested to see if it can survive a forty foot drop, just so she can be a youtube sensation. My apple ipad is now broken and she has 83 views. I know this is totally off topic but I had to share it with someone!

Leave a Reply