DETERMINISTIC FINITE AUTOMATA (DFA) EXAMPLE - 5 (DIVISIBLE BY) IN AUTOMATA THEORY || TOC

DETERMINISTIC FINITE AUTOMATA (DFA) EXAMPLE - 5
Design DFA which accepts all strings over given alphabet where binary integer divisible by given number
------------------------------------------------------------------------------------------
INTRODUCTION TO AUTOMATA THEORY AND ITS APPLICATIONS || THEORY OF COMPUTATION || FORMAL LANGUAGES
• INTRODUCTION TO AUTOMA...
BASIC NOTATIONS & REPRESENTATIONS IN AUTOMATA THEORY || BASICS OF AUTOMATA || THEORY OF COMPUTATION
• BASIC NOTATIONS & REPR...
WHAT IS FINITE AUTOMATA AND REPRESENTATION OF FINITE AUTOMATA || THEORY OF COMPUTATION
• WHAT IS FINITE AUTOMAT...
TYPES OF FINITE AUTOMATA (DFA & NFA) IN AUTOMATA THEORY || DFA & NFA || THEORY OF COMPUTATION
• TYPES OF FINITE AUTOMA...
DETERMINISTIC FINITE AUTOMATA (DFA) EXAMPLE - 1 (STRINGS STARTS WITH) IN AUTOMATA THEORY || TOC
• DETERMINISTIC FINITE A...
DETERMINISTIC FINITE AUTOMATA (DFA) EXAMPLE - 2 (STRINGS ENDS WITH) IN AUTOMATA THEORY || TOC
• DETERMINISTIC FINITE A...
DETERMINISTIC FINITE AUTOMATA (DFA) EXAMPLE - 3 (SUBSTRING OR CONTAINS) IN AUTOMATA THEORY || TOC
• DETERMINISTIC FINITE A...
DETERMINISTIC FINITE AUTOMATA (DFA) EXAMPLE - 4 (STRING LENGTH) IN AUTOMATA THEORY || TOC
• DETERMINISTIC FINITE A...

[@user-de5wo5mg1x]

What a great explanation of divisible by 3 meri classroom wali mam ne direct kahi se dekh ke figure banaya aur usko satisy karane lagi but now i got the actual solution.

[@Shuzeeme_go]

You're the best, sir.
You're the only one making Sense on this topic 👍💯

[@technologyworld106]

Make more video automata theory thank you I am following your lectures

[@salahhousaini2812]

A huge thanks to you 😊😊

[@ganeshbandhu6504]

Why shouldn't we proceed with the strings given in the L? Why we should we proceed with the all numbers which aren't in the L set? like 0,1,2,3..?

[@GopalMala-bq1cf]

Your teaching level is sooo good sir

[@prasadyarabati6081]

Well explanation 👏🙌

[@AjayECE]

Please make a more videos of c++ programming

[@shivammanitripathi4226]

In you previous videos you told .
No .of States= minimum length+1.
So according concept given by you here no of States should be 2.but u r taking 3.why?

[@mohdabdulmuqtadir1079]

because we are starting the language string from 3 that is 11 so 11 means n+1 =2+1=3

[@pujithadendukuri5851]

sir in previous video you have taken an eg which is binary integer divisible by 3 there u have taken decimal values 0-5 , and in this eg for binary integer divisible by 4 u have taken decimal values from 0-8?
how do we know sir how many decimal values to calculate ?

[@Annu_Chaudhary2004]

Maja aa gya...❤❤❤

[@mohamedmire8646]

hats to you off sir.

[@jadhawkumar8467]

Please check for this one (111111) for divisible by 3

[@Amirhosein_Farahmand]

thanks a lot sir

[@sowmya7920]

Can u teach Java programming

[@rakeshpidugu1948]

Integer divided by 5 means we have to take 5 states

[@sameeramaddiledu308]

Sir dfa doesn't accept the strings other than rhe given condition na sir..then divisible by 3 means here that dfa accepts 7 also na sir but 7 is not divisible by 3.why? Sir

[@user-pp1uk7gr2f]

Sir but for 7 it is not reaching the final state..(in second problem)

[@sarafashish9739]

Well said sir 🫡

[@saikumarthanagallapalli3687]

How to write that language

[@vikramhadi9213]

The question is the same but the string must start with 1 plz do it sir

[@manaswiniburra3294]

sir can q0 be a initial and final state

[@botez5671]

Yes