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

  Переглядів 62,520

Sundeep Saradhi Kanthety

Sundeep Saradhi Kanthety

День тому

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...

КОМЕНТАРІ: 23
@user-de5wo5mg1x
@user-de5wo5mg1x 24 дні тому
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.
@GopalMala-bq1cf
@GopalMala-bq1cf 21 день тому
Your teaching level is sooo good sir
@technologyworld106
@technologyworld106 2 роки тому
Make more video automata theory thank you I am following your lectures
@salahhousaini2812
@salahhousaini2812 Рік тому
A huge thanks to you 😊😊
@ganeshbandhu6504
@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..?
@prasadyarabati6081
@prasadyarabati6081 Рік тому
Well explanation 👏🙌
@pujithadendukuri5851
@pujithadendukuri5851 9 місяців тому
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 ?
@AjayECE
@AjayECE 2 роки тому
Please make a more videos of c++ programming
@Annu_Chaudhary2004
@Annu_Chaudhary2004 9 місяців тому
Maja aa gya...❤❤❤
@sameeramaddiledu308
@sameeramaddiledu308 8 місяців тому
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
@mohamedmire8646
@mohamedmire8646 Рік тому
hats to you off sir.
@shivammanitripathi4226
@shivammanitripathi4226 2 роки тому
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
@mohdabdulmuqtadir1079 Рік тому
because we are starting the language string from 3 that is 11 so 11 means n+1 =2+1=3
@real_amir9827
@real_amir9827 Рік тому
thanks a lot sir
@rakeshpidugu1948
@rakeshpidugu1948 Рік тому
Integer divided by 5 means we have to take 5 states
@sowmya7920
@sowmya7920 2 роки тому
Can u teach Java programming
@jadhawkumar8467
@jadhawkumar8467 10 місяців тому
Please check for this one (111111) for divisible by 3
@user-pp1uk7gr2f
@user-pp1uk7gr2f 2 місяці тому
Sir but for 7 it is not reaching the final state..(in second problem)
@saikumarthanagallapalli3687
@saikumarthanagallapalli3687 9 місяців тому
How to write that language
@sarafashish9739
@sarafashish9739 Рік тому
Well said sir 🫡
@manaswiniburra3294
@manaswiniburra3294 4 місяці тому
sir can q0 be a initial and final state
@botez5671
@botez5671 3 місяці тому
Yes
@vikramhadi9213
@vikramhadi9213 Рік тому
The question is the same but the string must start with 1 plz do it sir
DETERMINISTIC FINITE AUTOMATA (DFA) EXAMPLE - 6 (EVEN'S & ODD'S) IN AUTOMATA THEORY || TOC
14:07
Эффект Карбонаро и устройство для распаковки
01:00
История одного вокалиста
Переглядів 1,7 млн
когда одна дома // EVA mash
00:51
EVA mash
Переглядів 9 млн
DETERMINISTIC FINITE AUTOMATA (DFA) EXAMPLE - 4 (STRING LENGTH) IN AUTOMATA THEORY || TOC
15:49
2.2 How to Design Deterministic Finite Automata (DFA) | Theory of Computation | Automata Theory
12:02
Conversion of NFA to DFA
9:28
Neso Academy
Переглядів 1,4 млн
EPSILON CLOSURE IN AUTOMATA THEORY || NFA WITH EPSILON || TOC
10:15
Sundeep Saradhi Kanthety
Переглядів 66 тис.
1.3 DESIGN OF DFA WITH EXAMPLES || INTRODUCTION TO FINITE AUTOMATA || TOC || FLAT
13:59
dfa example with solution | Part-3 | TOC  | Lec-12 | Bhanu Priya
4:44
Education 4u
Переглядів 391 тис.
Эффект Карбонаро и устройство для распаковки
01:00
История одного вокалиста
Переглядів 1,7 млн