ฝัง
- เผยแพร่เมื่อ 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 DFA problems with explanation. #ShravankumarManthri#CSEGURUS #ShravankumarManthri#CSEGURUS
![[UNCUT] “บอสณวัฒน์” ลากไส้!! ใครหนุนหลัง "แม่ตั๊ก ป๋าเบียร์" I คนดังนั่งเคลียร์ I 30 ก.ย. 67](http://i.ytimg.com/vi/QlD7mU2KKRk/mqdefault.jpg)
Very helpful ❤
Sir can you please solve the string which are starts with a and ends with over (a,b)
THank You sir you explain so well
You are most welcome...Watch Turing Machine problems in the following link
www.udemy.com/course/formal-languages-and-automata-theory/learn/lecture/17998421?
Sir dfa mein hum trap state bhi toh banate hai
Sir what about the trap state
What would be the regular expression for this example
(a+b)*(a+bb)
good lecture
Thank u..
Watch Turing Machine problems in the following link
www.udemy.com/course/formal-languages-and-automata-theory/learn/lecture/17998421?
thankyou so much sir!!!!!!!!!meri job lag gyi ye video dekh ke..........40L p/a #microsoft#google#facebook
Thats great and very happy to hear...
Sir can u please tell me wt tools do u use to make these kind of videos?
ispring for recording..
can i ask questions how will you construct a DFA that accepts any strings over {a, b} that does not contain the string abb in it??? Please reply i need answer!
Initially construct DFA for containing abb. Then make all final as non final states and vice-versa.
good explain
Thank you. Keep Learning.
Choco