ฝัง
- เผยแพร่เมื่อ 3 ต.ค. 2024
- Technical lectures by Shravan Kumar Manthri.
Watch Top 100 C MCQ's
• Top 100 MCQs in C ("Wa...
Watch Technical C programming
• Technical C coding : p...
Watch Data Warehousing & Data Mining
• 1. Multi-Dimensional ...
Watch Design & Analysis of Algorithms
• 1. Introduction to the...
Watch Formal Languages & Automata theory
• 1. Introduction to Aut...
Contact me @ fb : shravan.kites@gmail.com
Like us on fb: CSE GURUS
This video explains e-closure of a state in Finite Automata. #ShravankumarManthri#CSEGURUS #ShravankumarManthri#CSEGURUS
4:55 there is no e (epsilon for q3) then how ? , self alsp not sir ?,
Good explanation sir , thank you
You're most welcome...
Watch Turing Machine problems in the following link www.udemy.com/course/formal-languages-and-automata-theory/learn/lecture/17998421?
@@CSEGURUSok sir
Sir please explain design of nfa
Nice lecture sir.... It's just awsome 👍👍👍
Thanks a ton..Watch Turing Machine problems in the following link
www.udemy.com/course/formal-languages-and-automata-theory/learn/lecture/17998421?
@@CSEGURUS okk sir
@@CSEGURUS thanks sir
Best explanation :)
Glad you liked it...Glad it helped...Watch Turing Machine problems in the following link
www.udemy.com/course/formal-languages-and-automata-theory/learn/lecture/17998421?
thank you sir
Most welcome..
Watch Turing Machine problems in the following link
www.udemy.com/course/formal-languages-and-automata-theory/learn/lecture/17998421?
Please speak loudly sir, thanks
Simple and nyz
Thanks for liking.. Keep Learning..
super !!!!
Thank you! Cheers!
@@CSEGURUS sir please explain design of NFA
sir please speak loud
Thank you sir
you are Welcome...Watch Turing Machine problems in the following link
www.udemy.com/course/formal-languages-and-automata-theory/learn/lecture/17998421?