Formal Languages & Automata Theory-FLAT-Part-14 (NFA example-1) (JNTUK,JNTUH,JNTUA,JNTUGV)|GATE FLAT
HTML-код
- Опубликовано: 19 янв 2025
- Formal Languages & Automata Theory-FLAT to meet all JNTUK,JNTUH,JNTUA,JNTUGV and all university Syllabus and Also Usefull for GATE Preparation.
Topics: Introduction to NFA
please reach us : learnwithlakineni.pk@gmail.com
Please like the video, this really motivates us to make more such videos and helps us to grow. Learn with Lakineni is a community which is formed to help fellow students and professionals looking to crack the “coding interviews”. We love solving and sharing problems which are frequently asked in technical interviews.
Nice videos sir. keep doing more for students benift. all the best sir.
nice explanation on NFA. We got idea on designing NFA. Please post some more NFA examples sir. Thank you Lakineni Sir.
excellent sir.
Good video sir
NICE explanation sir