Lecture 13_ DFA (Deterministic Finite Automata) with solved examples

In this lecture Deterministic Finite Automata (DFA) has been covered with help of examples. This lecture is also helpful in order to distinguish between NFA & DFA.

Remember 3 points for DFA
1) no empty string
2) No. of transaction from each sate is equal to number of letters given in alphabet.
For example, if ∑ = {a, b}. This alphabet has two letter i.e, a and b. That means from every state there will be two transaction. (two arrows on each state)
3) It may also contains reject state.

Reject state is a state which never allow us to reach final state.

#AZComputing

[virtualuni]

Muje kahin bhi itnay behtreen lecture nhe dikha jo itnay tariqay se with example samihaya ho, aur sab se achi baat hai k ap jaan nhe churarhy, bal k zyada se zyada examples kara rahy hain isse concept clear horaha hai.

[onlywasigaming]

Thanks Sir 1 hi lecture ma sara confucian hateem hogiya❤❤❤❤❤❤❤

[FizaAlam-nm]

Thank you so much sir DFA pchla aik gnata sa m koshash kr Rai nai bna pai r apki 3 sa 4 example k bad muja ha gya ❤

[waqardogar]

Sir g love you hogya iss tarah kisi or na nahi smjhaya jis trh apny smjhaya love you hogya sir g 😘😘😘.

[nida]

Thanku hum vu kay student Hai app nay same hi LEC kerwa hai jesa hamari book pay hai thanks

[Aima]

Thank you sir bht acha hy ap k prhany ka triqa

[gamesden]

Your video lecture is so beneficial but my question is how to draw adfa of three or more symbol alphabet like that £{a b c} plz explain ma doubt

[haseebkhan]

aoa sir
sir agr (a+b)* shuru mai aa jaa toh usko kasy present kary gay

[muhammedhasnain]

2nd last example mn q1 PA agr a ata ha to a pa hii raha ga I think so

[haseebkhan]

a (a + b)* a + b (a + b)* b sir how can i draw dfa of this re

[QuranPashtoTranslation]

write the finite autometa and reguler expression that start and end with same alphabet and at least contain aa and bb
please sir g solve this question