- 276
- 283 327
Mithun BN
India
เข้าร่วมเมื่อ 26 ก.ย. 2017
The channel is created to upload the videos in the field of computer science, culture, history and linguistics. And videos from kids are also uploaded.
Channel contains videos on the Subject - 'Automata Theory'. It is an important subject in computer science specialization. It is one of the interesting subject in the field of computer science. I have made the problems very simple, easy and clear. Any student can understand the problems in DFA, NFA, RE, CFGs, PDA and Turing Machines.
Also there are videos on History, Language. Cultural Videos are also available.
Videos on how to learn Kannada Language are also available.
Target audience are the people who are studying computer science course and who are interested in Folklore, History and Linguistics.
#AutomataTheory #ComputerScience
#Kannada #Folklore #History #Karnataka
Channel contains videos on the Subject - 'Automata Theory'. It is an important subject in computer science specialization. It is one of the interesting subject in the field of computer science. I have made the problems very simple, easy and clear. Any student can understand the problems in DFA, NFA, RE, CFGs, PDA and Turing Machines.
Also there are videos on History, Language. Cultural Videos are also available.
Videos on how to learn Kannada Language are also available.
Target audience are the people who are studying computer science course and who are interested in Folklore, History and Linguistics.
#AutomataTheory #ComputerScience
#Kannada #Folklore #History #Karnataka
วีดีโอ
Predictive Parsing | Top Down Parsing | Compiler Design | Mithun B N
มุมมอง 13010 หลายเดือนก่อน
Predictive Parsing | Top Down Parsing | Compiler Design | Mithun B N
Language Processing System | Compiler Design |Mithun B N
มุมมอง 225ปีที่แล้ว
Language Processing System | Compiler Design |Mithun B N
Phases of Compilers | Compiler Design | Mithun B N
มุมมอง 277ปีที่แล้ว
Phases of Compilers | Compiler Design | Mithun B N
View from Biligiri Rangana Betta | Chamarajanagara | ಬಿಳಿಗಿರಿ ರಂಗನ ಬೆಟ್ಟದ ನೋಟ | ಚಾಮರಾಜನಗರ
มุมมอง 95ปีที่แล้ว
View from Biligiri Rangana Betta | Chamarajanagara | ಬಿಳಿಗಿರಿ ರಂಗನ ಬೆಟ್ಟದ ನೋಟ | ಚಾಮರಾಜನಗರ
Performance of Christies in Bhasha Uthsava 2023 | Kamsale | Huli Vesha | Yakshagana
มุมมอง 490ปีที่แล้ว
Performance of Christies in Bhasha Uthsava 2023 | Kamsale | Huli Vesha | Yakshagana
Turing Machine - Introduction | Automata Theory | Mithun B N
มุมมอง 257ปีที่แล้ว
Turing Machine - Introduction | Automata Theory | Mithun B N
Learn Kannada | #5| Pronouns|Colours| Simple Conversation in Kannada| Mithun BN
มุมมอง 1282 ปีที่แล้ว
Learn Kannada | #5| Pronouns|Colours| Simple Conversation in Kannada| Mithun BN
Poem - A Happy Child | Namitha | Karnataka Public School | Bengaluru
มุมมอง 4322 ปีที่แล้ว
Poem - A Happy Child | Namitha | Karnataka Public School | Bengaluru
Elimination of Left Recursion from the given Context Free Grammar | Automata Theory|33|Mithun B N
มุมมอง 3302 ปีที่แล้ว
Elimination of Left Recursion from the given Context Free Grammar | Automata Theory|33|Mithun B N
Learn Kannada from English | #4 | ಕನ್ನಡ ಕಲಿಯಿರಿ | Directions in Kannada | Mithun B N
มุมมอง 2262 ปีที่แล้ว
Learn Kannada from English | #4 | ಕನ್ನಡ ಕಲಿಯಿರಿ | Directions in Kannada | Mithun B N
Different shapes from wheat flour | Namitha | ಗೋಧಿ ಹಿಟ್ಟಿನಿಂದ ಬೇರೆ ಬೇರೆ ಆಕಾರಗಳು | ನಮಿತಾ
มุมมอง 1802 ปีที่แล้ว
Different shapes from wheat flour | Namitha | ಗೋಧಿ ಹಿಟ್ಟಿನಿಂದ ಬೇರೆ ಬೇರೆ ಆಕಾರಗಳು | ನಮಿತಾ
DFA ending with 'ab' or 'ba' | Automata Theory in Kannada | Mithun B N
มุมมอง 7032 ปีที่แล้ว
DFA ending with 'ab' or 'ba' | Automata Theory in Kannada | Mithun B N
DFA starting with 'ab' | Automata Theory in Kannada | ಕನ್ನಡದಲ್ಲಿ ಆಟೊಮೆಟಾ ಥಿಯರಿ | Mithun BN
มุมมอง 4622 ปีที่แล้ว
DFA starting with 'ab' | Automata Theory in Kannada | ಕನ್ನಡದಲ್ಲಿ ಆಟೊಮೆಟಾ ಥಿಯರಿ | Mithun BN
Namitha painting house using vegetables as brush
มุมมอง 4222 ปีที่แล้ว
Namitha painting house using vegetables as brush
Context Free Grammars | Problems on CFG | Automata Theory | 31 | Mithun B N
มุมมอง 4433 ปีที่แล้ว
Context Free Grammars | Problems on CFG | Automata Theory | 31 | Mithun B N
Pumping Lemma for Regular Languages | Proving languages not to be Regular | 29 | Mithun B N
มุมมอง 3713 ปีที่แล้ว
Pumping Lemma for Regular Languages | Proving languages not to be Regular | 29 | Mithun B N
Ardens Theorem - Conversion from Finite Automata to Regular Expression | 28 | Mithun BN
มุมมอง 2243 ปีที่แล้ว
Ardens Theorem - Conversion from Finite Automata to Regular Expression | 28 | Mithun BN
Conversion from Epsilon NFA to DFA | Example 3| 22| Mithun BN
มุมมอง 2373 ปีที่แล้ว
Conversion from Epsilon NFA to DFA | Example 3| 22| Mithun BN
Learn Kannada from English | #3 | ಕನ್ನಡ ಕಲಿಯಿರಿ | Fruits name in Kannada | Mithun B N
มุมมอง 1683 ปีที่แล้ว
Learn Kannada from English | #3 | ಕನ್ನಡ ಕಲಿಯಿರಿ | Fruits name in Kannada | Mithun B N
Problems on conversion from Regular Expression to Finite Automata | 27 | Mithun BN
มุมมอง 1.8K3 ปีที่แล้ว
Problems on conversion from Regular Expression to Finite Automata | 27 | Mithun BN
Learn Kannada from English | #2 | Kannda Numbers | ಕನ್ನಡ ಕಲಿಯಿರಿ | Mithun B N
มุมมอง 3413 ปีที่แล้ว
Learn Kannada from English | #2 | Kannda Numbers | ಕನ್ನಡ ಕಲಿಯಿರಿ | Mithun B N
Learn Kannada from English | #1 | ಕನ್ನಡ ಕಲಿಯಿರಿ | Vegetable names in Kannada | Mithun B N
มุมมอง 5783 ปีที่แล้ว
Learn Kannada from English | #1 | ಕನ್ನಡ ಕಲಿಯಿರಿ | Vegetable names in Kannada | Mithun B N
Finite Automata and its representation | Kannada | ಕನ್ನಡದಲ್ಲಿ | 2 | Mithun B N
มุมมอง 5703 ปีที่แล้ว
Finite Automata and its representation | Kannada | ಕನ್ನಡದಲ್ಲಿ | 2 | Mithun B N
Introduction to Automata Theory | Kannada | Session 1 | ಕನ್ನಡದಲ್ಲಿ | Mithun B N
มุมมอง 8263 ปีที่แล้ว
Introduction to Automata Theory | Kannada | Session 1 | ಕನ್ನಡದಲ್ಲಿ | Mithun B N
Push Down Automata (PDA) to accept the language L={a^2n b^n where 'n' greater than 0} | Mithun BN
มุมมอง 13K4 ปีที่แล้ว
Push Down Automata (PDA) to accept the language L={a^2n b^n where 'n' greater than 0} | Mithun BN
Push Down Automata (PDA) to accept the language L={a^n b^2n where 'n' greater than 0} | Mithun BN
มุมมอง 10K4 ปีที่แล้ว
Push Down Automata (PDA) to accept the language L={a^n b^2n where 'n' greater than 0} | Mithun BN
General Procedure to convert Regular Expressions to Finite Automata | 26 | Mithun B N
มุมมอง 1.5K4 ปีที่แล้ว
General Procedure to convert Regular Expressions to Finite Automata | 26 | Mithun B N
Problems on Regular Expressions | 2 | 25 | Mithun B N
มุมมอง 1.7K4 ปีที่แล้ว
Problems on Regular Expressions | 2 | 25 | Mithun B N
very nice explanation thanks. i think there is a small mistake ; at 8:02 transition on epsilon must be from q2 to q3 not from q0 to q3
Thank you for much. Yes you are right. There is a mistake. Sorry for that.
Sir if we consider atleast 5 consecutive symbols which contains 2 a's then we can also go with 5 symbols as min in that condition if the min length of the string is 5 then shouldn't we have 6 states isn't it correct sir
Can't we make a diagram with the 6 states
yes. if you are fixing the length of string as only 5, then six states are enough.
@@mithunbn thank you sir it's very valuable
@@telukula.rohith5938 Thank you.. Please share channel details with your friends.
Sir Shouldn't we worry about the (min length+1) how many states here we have to consider sir
sir ho do we solve if its instead of atleast 2 a's it is two consecutive a's
then some transitions from the state q6 have to be changed.
@mithunbn sir is there any way I can send the one I drew
awesome From tkm student kerala
Namaste masters.
❤
🙏🏻🙏🏻🙏🏻🪷🪷🪷
,🙏🏻🙏🏻🙏🏻🪷🪷🪷
Namaste masters 2:37:32
,🙏🏻🙏🏻🙏🏻🪷🪷🪷
🙏🙏🙏🙏
Zoom link plz
The breath is the most secret mantra.
Namaskar
Namaste masters
Tq❤🎉❤
DFA accepts only one path
but for "aabbba" the answer should be at final state ie q5 but it is at q1 ....
DFA is for block not for symbols. Here, whenever you choose a new block it will start from from first symbol of that block
design pda which accept the language l={ a^4n:n>=1} and test for string aaaaaaaa and aaaaaa.
design pda which accept the language l={ a^4n:n>=1} and test for string aaaaaaaa and aaaaaa. Please help me sir
🎉🎉🎉
🙏💚💚💚🌹🌹🙏
🙏🙏🙏🙏
Wonderful effort keep it up God bless you vinutha
Tq so much universe 💚💚🌎🧘🏻♀️🧘🏻♀️🙏🏻🙏🏻
🙏🙏
Namaste masters 🙏🏻🙏🏻🙏🏻
🙏
Sir i Rama like to join this meditation please give me details from konanakunte Bangalore.
Hi
Sir the DFA is incorrect, as it doesn't accept aabbba
Please check the question and understand the logic. It says any five consecutive symbols.
@@mithunbn sir even the title says "every"
@@GatePrepAnurag every block of 5 consecutive symbols. consider any 5 consecutive symbols.
🙏🙏🙏🙏
🙏🙏🙏🙏🙏
🙏👍🙏🙏🙏🙏I love all masters wonderful work. Thank you so much Patricia mahagurugale❤
🙏
Thank you! This helped me a lot!
Thank you.. Share with your known contacts.
Thank You Sir
welcome. Please share with your known contacts.
Thank u so much sir......excellent explanation
Thank you for the feedback. Share with your friends.
No one explains this with an example so this really helped!
Thank you very much for the message. Share with your friends.
Next video sir?
next month it will be uploaded.
Sir 3rd video where ? Continuous video sigta ella sir
next month upload madtini.. ivaga madilla.. sorry
Hey , awesome videos.Take love from Bangladesh
Thank you. Share the link with your friends.
Sir what about aabbbbaaaa?
Observe the string clearly. It has total 10 symbols. Consider any five consecutive symbols and check.. If it has at least two a's, it will be accepted. If not rejected.
sir your dfa accepts this;however it should be rejected as it contains abbbb@@mithunbn
@@rvb281 the string abbbb will be rejected.. check once again..
🎉
Thank you
Thank you Sir, I was searching for this question everywhere.
Thank you very much. Please do share with your friends.
Very nice performance 👏👏
Very nice 👌🏻
Thank you mahesh avare....
Sir , aaaabbaa should be accepted but in this automata it is not getting accepted
check the string.. any five consecutive symbols will be accepted. not complete string.
There is a small mistake in this solution, aabbbbabb is accepted by the automata, but it has a block abbbb(from 2nd index) which is not satisfying the condition
check again properly. It will not accept the string, as there are 4 consecutive b's.
That string will not be accepted, but how about aabbbbaaaa?
But thos string should not be accepted because it has 4 consecutive bs
@@josephben9435 please do understand. DFA is designed for every block of 5 symbols. not all the symbols in the given string. In case of your string, consider any five consecutive symbols, say-'aabbb' it is accepted. if you consider string 'bbbba', it will be rejected.