NFA Examples || Non Deterministic Finite Automata || Theory of Computation || TOC || FLAT
Вставка
- Опубліковано 9 лют 2025
- 1. Compiler Design Playlist: • Compiler Design
------------------------------------------------------------------------------------
2. Computer Organization and Architecture Playlist: • Computer Organization ...
---------------------------------------------------------------------------------------
3. Operating Systems Playlist:
• Operating Systems
----------------------------------------------------------------------------------------
4. C Programming Playlist:
• C Programming
--------------------------------------------------------------------------------------------------------------------------
5. Java Programming Playlist:
• JAVA PROGRAMMING
---------------------------------------------------------------------------------------------------------------------------------
6. Data Structures Playlist:
• Data Structures
---------------------------------------------------------------------------------------------------------------------
7. Web Technologies Playlist:
• Web Technologies
----------------------------------------------------------------------------------------------------------------
8. C++ Programming Playlist:
• C++ Programming
--------------------------------------------------------------------------------------------------------------------------
9. DAA ( Design and Analysis of Algorithms) Playlist:
• DAA ( Design and Analy...
----------------------------------------------------------------------------------------------------------------------------
10. Python Programming Playlist:
• PYTHON PROGRAMMING
---------------------------------------------------------------------------------------------------------------------------
11. DMS ( Discrete Mathematical Structures ) Playlist:
• Discrete Mathematics (...
----------------------------------------------------------------------------------------------------------------------------------
12. C#.net Playlist:
• C#.NET
--------------------------------------------------------------------------------------------------------------------------------------
13. OOP through Python Playlist:
• Python OOP ( Object Or...
Sir, can you please tell why you took q1 as final state in the last problem
Sorry, by mistake I have taken, q1 is not a final state. Plz subscribe to the channel and if possible share with your friends. Thanks in advance..
Sir I could not thank you enough for this amazingg video. Hands down the best explanation of NFA on youtube. God bless you sir.
Thanks. Plz subscribe to the channel and if possible share with your friends. Thanks in advance..
love from uzbekhistan ❤🔥
Thanks. Plz subscribe to the channel and if possible share with your friends. Thanks in advance.
Instead of paying lakhs of rupees to the university, we can pay you, learn from you, and graduate
sir, in 7th problem on q1 we have to apply self loop as 0,1 right, as strings with multiple zeroes between 1 and 0 could come? please reply, my exam is near
Sir in last problem we have to take 3 states right because ab is the inouts so 2+1 3 states so tht means q0 and q2 will be final states ?
yes both are final states. Please like the videos, subscribe to the channel, and share it with your friends. Thanks in advance.
Sir in last problem if we take q1 as final then the string "a" Also accepts right but we want ab^n to accept?? So it is final or non final state??
your FAN sir love your work very very useful sir god bless u and ur family,channel everything related to u sir
Thank you so much 😀 Please like the videos, subscribe to the channel, and share it with your friends. Thanks in advance.
very well explained
Thanks. Please like the videos, subscribe to the channel, and share it with your friends. Thanks in advance.
In the 6th question string containing '01' or '10' Is there a need to use the state Q4 ? or we can normally use Q3 and on (Q3,0) to goes to Q2(final state) Can we do like that sir Please answer
Okay, you can do like that also. Plz subscribe to the channel and if possible share with your friends. Thanks in advance..
sir thank you so so much for this video !!!!!
welcome. Please like the videos, subscribe to the channel, and share it with your friends. Thanks in advance.
You are God sir😊
You too. Plz subscribe to the channel and if possible share with your friends. Thanks in advance..
Superb ❤if you explain this in hindi it will be more understandable for every one
Okay. Please like the videos, subscribe to the channel, and share it with your friends. Thanks in advance.
U deserve more reach ❤
These lectures are really amazing
Thank you so much 😀 Plz subscribe to the channel and if possible share with your friends. Thanks in advance...
Superb sir ❤❤
Thanks Plz subscribe to the channel and if possible share with your friends. Thanks in advance..
In 9 th problem we can take self loop (a,b) for final state ,is that possible sir
Yes yes can, but that is not 100% correct.
Plz subscribe to the channel and if possible share with your friends. Thanks in advance..
Q. Design Non Deterministic Finite Automaton that accepts set of all strings over {0,1} that start with 0 or 1 and end with 01 or 10.
Sir actually in nfa back tracking is not possible. But you are use in example 7
By applying input we can go to its previous state also, no problem. It's not backtracking.Plz subscribe to the channel and if possible share with your friends. Thanks in advance..
Thank youuu soo much sir ❤
Most welcome. Plz subscribe to the channel and if possible share with your friends. Thanks in advance..
Sir can we have a,b on final state in 4th problem??(self transition)
not needed. Please like the videos, subscribe to the channel, and share it with your friends. Thanks in advance.
Sir in problem 6, minimum length of string is 2 only, then how u draw 4 states
it accepts 2 strings 01 or 10. Plz subscribe to the channel and if possible share with your friends. Thanks in advance...
Thank you so much sir
Most welcome. Plz subscribe to the channel and if possible share with your friends. Thanks in advance..
sir in last problem y we have not taken ab as minimum string and obtain 3 states?
I.e. enough, if you want you can draw with 3 states by taking ab. Please like the videos, subscribe to the channel, and share it with your friends. Thanks in advance.
@@SudhakarAtchala thankyou sir💐
In question 7, isn’t q0 (1)-> q1 (0,1) -> q1 (0)->q2(accept) also a solution?
Thank you.
Yeah
but that is not 100% correct solution. Plz subscribe to the channel and if possible share with your friends. Thanks in advance...
thank you veryyyyy much sirrr
Most welcome. Plz subscribe to the channel and if possible share with your friends. Thanks in advance...
Sir is backtracking is possible in nfa google saying its not
backtracking means exploring various paths, if string is not found in one path then check in another path. Please like the videos, subscribe to the channel, and share it with your friends. Thanks in advance.
Tq sir😇
Welcome 😊. Plz subscribe to the channel and if possible share with your friends. Thanks in advance..
sir in 7th problem can we apply 0,1 for q1 is that possible as there are multiple transitions
not needed. Please like the video, subscribe to the channel, and share it with your friends. Thanks in advance.
👍
Thanks. Please like the videos, subscribe to the channel, and share it with your friends. Thanks in advance.
sir can you tell in last question why you applied both states as final states?
refer 1st comment. Plz subscribe to the channel and if possible share with your friends. Thanks in advance..
Sir start teaching for ugc net
K sure. Plz subscribe to the channel and if possible share with your friends. Thanks in advance.
Tnq
Welcome. Plz subscribe to the channel and if possible share with your friends. Thanks in advance..
Thanks for the videos sir😍
Always welcome. Plz subscribe to the channel and if possible share with your friends. Thanks in advance..
Sir in 4th question can we put ab as self loop in final state?
yes you can. Plz subscribe to the channel and if possible share with your friends. Thanks in advance...
hi sir. i have small dout that in the 2nd problem is there any change to put a self loop 0 on q1
No problem. Plz subscribe to the channel and if possible share with your friends. Thanks in advance.
Sir Is it possible to create multiple DFAs AND NFAs to same problem
Yes we can have
Sir NFA and NDFSM both are same?
Yes. Plz subscribe to the channel and if possible share with your friends. Thanks in advance..
String Ends with 01 diagram is not satisfying the 10001 string
1,0,0 means we will be at q0 only, q0 on 0 means q1, q1 on 1 means q2 which is final state . Plz subscribe to the channel and if possible share with your friends. Thanks in advance..
@@SudhakarAtchala yh sir thankyou
Love from Canada sir 🩷
Thanks. Plz like the videos and if possible share with your friends. Thanks in advance.
🎉🎉
Thanks. Plz subscribe to the channel and if possible share with your friends. Thanks in advance..
Sir DFA lo oka way lo kakunda vere method lo kuda cheyocha
Yes yes can. Plz subscribe to the channel and if possible share with your friends. Thanks in advance..
Sir You are from which state of India
Your pronounciation is so different
Andhra Pradesh. Plz subscribe to the channel and if possible share with your friends. Thanks in advance.
Hi sir can you make the same 10 solved example short video for DFA
K. Plz subscribe to the channel and if possible share with your friends. Thanks in advance.
Sir why we can take q0 q1q2 why can't take q3 perfect ga inni tesukovalo ani ela telsutundhi sir sir pls rly
depends on problem, we have to choose. Plz subscribe to the channel and if possible share with your friends. Thanks in advance...
Thanku sir 🙏
Most welcome. Plz subscribe to the channel and if possible share with your friends. Thanks in advance..
U r so good 🥹
Thanks. Please like the videos, subscribe to the channel, and share it with your friends. Thanks in advance.
U are very cute bro!
Thanks. Plz subscribe to the channel and if possible share with your friends. Thanks in advance.