- 73
- 118 694
Dr. Sagarkumar Badhiye
India
เข้าร่วมเมื่อ 6 ต.ค. 2011
For programmer / Academicians / Students / Collaboration with industry persons
the channel mainly focuses on
-Compiler Design
-Theory of Computations
-LaTeX
-Python Programming
-C Programming
Mail for Collaboration: sagarbadhiye@gmail.com
the channel mainly focuses on
-Compiler Design
-Theory of Computations
-LaTeX
-Python Programming
-C Programming
Mail for Collaboration: sagarbadhiye@gmail.com
Installing Python Compiler and Anaconda
In this video we will see how to install Python Compiler and Anaconda Navigator for programming. #python #installation #install #anaconda #idle #engineering #IDE
มุมมอง: 339
วีดีโอ
AI vs ML vs DL vs DS
มุมมอง 612 ปีที่แล้ว
In this video, the relationship between #ArtificialIntelligence, #DeepLearning, #DeepLearning, #DataScience is explained. The types of #MachineLearning viz. #SupervisedLearning, #UnsupervisedLearning, #Semi-SupervisedLearning, #ANN, #CNN, #RNN is explained in brief. Later, the recent trends in Deep Learning are also discussed. #DeepLearningTrends #mnist #implementationcnn #cnn
Turing Machine Examples
มุมมอง 1762 ปีที่แล้ว
In this video, Examples on design of Turing Machine is explained #pda #turingmachine #tm #design
Turing Machine Introduction
มุมมอง 2042 ปีที่แล้ว
In this video, the issue in PDA is discussed and how it is overcome with Turing Machine is explained. An introduction to Turing Machine is also explained #pda #turingmachine #tm #design
PDA More Examples
มุมมอง 1542 ปีที่แล้ว
In this video, Instantaneous Descriptor is discussed and a few more examples of the design of a simple PDA #pushdownautomata #pda #automata #toc #id #acceptanceofstring
PDA Example
มุมมอง 1962 ปีที่แล้ว
In this video, few examples of the design of a simple PDA #pushdownautomata #pda #automata #toc
PDA Introduction
มุมมอง 1672 ปีที่แล้ว
In this video, the need for PDA and its structure is discussed with an example of the design of a simple PDA #pushdownautomata #pda #automata #toc
GNF
มุมมอง 872 ปีที่แล้ว
In this video, An example of obtaining GNF from CFG is also explained #cfg #normalform #cnf #gnf
NF, CNF
มุมมอง 1212 ปีที่แล้ว
In this video, Normal Forms are discussed, Types of Normal Forms and their structure in terms of a Production rule are also discussed. An example on obtaining CNF from CFG is also explained #cfg #normalform #cnf #gnf
Finite Automata to Regular Expression Example 3
มุมมอง 882 ปีที่แล้ว
Finite Automata to Regular Expression Example 3 #regularexpression #automata #conversion
Finite Automata to Regular Expression Example 2
มุมมอง 962 ปีที่แล้ว
Finite Automata to Regular Expression #regularexpression #conversion #automata
Finite Automata to Regular Expression Example 1
มุมมอง 2302 ปีที่แล้ว
In this video we discuss how to obtain a Regular Expression for a given Finite Automata #conversion #regularexpression #re #fa #automata
1-27 Moore to Mealy Conversion
มุมมอง 923 ปีที่แล้ว
In this video, I have explained the process of conversion of a Moore Machine to an equivalent Mealy Machine. Click on the Like Button if You Like the Video and Subscribe the Channel for more videos #theoryofcomputation #automata #introduction #abstractmachines #mooremachine #automata #fsm #fa #mooretomoore #conversion #mealy #sagarbadhiye #sagarkumar
1-26 Mealy to Moore Conversion Example 2
มุมมอง 1143 ปีที่แล้ว
In this video, I have explained the process of conversion of a Mealy Machine to an equivalent Moore Machine. Click on the Like Button if You Like the Video and Subscribe the Channel for more videos #theoryofcomputation #automata #introduction #abstractmachines #mooremachine #automata #fsm #fa #mealytomoore #conversion #mealy #sagarbadhiye #sagarkumar
1-25 Mealy to Moore Conversion Example 1
มุมมอง 1943 ปีที่แล้ว
In this video, I have explained the process of conversion of a Mealy Machine to an equivalent Moore Machine. Click on the Like Button if You Like the Video and Subscribe the Channel for more videos #theoryofcomputation #automata #introduction #abstractmachines #mooremachine #automata #fsm #fa #mealytomoore #conversion #mealy #sagarbadhiye #sagarkumar
1-24 Design Moore Machine to output 'x' every time it reads a sequence '1010'
มุมมอง 1.3K3 ปีที่แล้ว
1-24 Design Moore Machine to output 'x' every time it reads a sequence '1010'
1-23 Design of Mealy Machine for Addition of Two Binary Numbers
มุมมอง 10K3 ปีที่แล้ว
1-23 Design of Mealy Machine for Addition of Two Binary Numbers
Writing a Technical Report on Innovation
มุมมอง 1163 ปีที่แล้ว
Writing a Technical Report on Innovation
Crash Course on LaTeX: Learn in 90 Minutes
มุมมอง 6053 ปีที่แล้ว
Crash Course on LaTeX: Learn in 90 Minutes
NLP Practical on Tokenization, Stemming, Stop Word Removal and POS Tagging
มุมมอง 12K3 ปีที่แล้ว
NLP Practical on Tokenization, Stemming, Stop Word Removal and POS Tagging
2-14 Language Specification of CFG example 5
มุมมอง 1794 ปีที่แล้ว
2-14 Language Specification of CFG example 5
2-13 Language Specification of CFG example 3 4
มุมมอง 1854 ปีที่แล้ว
2-13 Language Specification of CFG example 3 4
2-12 Language Specification of CFG example 2
มุมมอง 2514 ปีที่แล้ว
2-12 Language Specification of CFG example 2
2-11 Language Specification of CFG to specify all strings that are Palindromes over a and b
มุมมอง 4224 ปีที่แล้ว
2-11 Language Specification of CFG to specify all strings that are Palindromes over a and b
2-10 Removal of Ambiguity from Context Free Grammar
มุมมอง 3.3K4 ปีที่แล้ว
2-10 Removal of Ambiguity from Context Free Grammar
2-9 Examples on Ambiguity of CFG and Inherently Ambiguous Context Free Language
มุมมอง 3.6K4 ปีที่แล้ว
2-9 Examples on Ambiguity of CFG and Inherently Ambiguous Context Free Language
thank you sir well expalined
maza agaya sir well explaned
👏👏👏
padhai pe dhayan kabse dera bhai toh
Very Informative Session.Clear explanation of all concepts is done.
This helped me a lot for my exam preprations. Thank you so much sir.
Glad to hear that
Good explanation
Thanks and welcome
Super sir...
sir can u pls provide the ppt for this topic
can u pls provide the notes or material for this session sir
thanku sir .....nicely explained
crystal clear explanation. thank you so much for educating us.
Glad it was helpful!
Very well explained sir ❤ tomorrow is my exam n this video is just like a woww 😂❤
Thanks
At 5:53 did you switch T with S for the first rule? You did expland it into T -> .S, T instead of T-> .T, S as shown in the right top corner.
Typo
@@sagarbadhiye so the final answer isnt right aswell?
Very elegant explanation. Thank you for sharing this video, sir.
Why do we need to remove left recursion here? Do we need to remove left recursion everytime we want to do top-down parsing?
Yes, we have to remove left recursion every time, as with left recursion we cannot decide the starting terminal directly and hence we convert to right recursion
It helped me a lot
Good
Well explained
Thank you
At 9:13, shouldn't we convert the SDT to S type (to remove the inherited attributes) first, before parsing in bottom up manner?
For T->F at 11:27, how is there no action. Aren't we assigning F.val to T.val ?
It is already available on the stack top. As we are discussing about Value Stack implementation, it won’t be computed it will simply be assigned existing value
You can check stack operations shown in example from 14:00 onwards
Can you PLEASE PLEASE explain FTS for non concatenative words
do we need to know previous topics like syntax analysis to understand semantics?? or can i just continue from here as this is the first topic included in the finals
Yes, you should have some idea
Thank u sir🌺
what about subtraction? I've read in my book: "If a and b are strings of bits, then the subtraction a - b can be performed by (1)adding the l's complement of b to a ignoring any overflow digit and (2) incrementing the results by 1", and I have two questions regarding this: how can we draw or connect the 1's complement of b machine and then add it to a? And after that how do we increment it?
amazing lectures so underrated channel the relevency of content is so so good >>>>>>>>>>>>>>>>>>
Thank you so much. Kindly help to improve the rating’s of my channel🙏🏻
Tip :- to increase view count change the topic of your videos and make it more college orientated whole aktu THEORY OF AUTOMATA SYLLABUS HAS been covered by you sir but when students search your channel never appears just because your title and tags of videos aren't relevant according to you try to understand how yt search results work and start adding and tagging btech students and theory of AUTOMATA that will boom your channel view for sure
Please help me with python code of POS with maximum entropy model
Wait- labda mein <0,c> and <1,c> kaha se aya in the end? at 17:24
Its extra, i considered c also
Sir did you make videos on how FST work? This lecture is great by the way!!!
Will upload soon
Thanks for appreciating. Kindly help me get 1k subscribers. Click on the Bell Icon to be 1.🙏🏻
What about subtraction
Do you want me to upload its video?
@@sagarbadhiye Yes please!!!!!
@@sagarbadhiye please do, it will be a big help.
Sir ye ppt ki link milegi ky
Kindly subscribe to the channel for more contents
It’s payable
Good explanation.
are you ready to support me to work on pos tagging for local language (like Afaan oromoo) if ok send some reference materials to me Dr
Ok will send in some time
Thank you
great - i like to have old lectures
I wish I could give thousands of likes to this video
Thank you so much 😊
You can support by Subscribing the channel and promoting among friends 😊
Can we do this in colab notebook?
Yes
@@sagarbadhiye Sir do you have a social media or anything where we can contact you...because I have many questions.
@@captainlevi7188 you can find me on fb, LinkedIn and gmail
@@captainlevi7188 facebook.com/sagar.badhiye sagarbadhiye@gmail.com
This helped me a lot. You explained very clearly. Thank you so much
Thanks dear
If you want any other topic kindly let me know
Can you send all the commands in a file
I will share it in a day or 2
@@sagarbadhiye Thank you
Subscribe the channel to get more content
@@sagarbadhiye Sure
pls help me with how can we POS tagging for Arabic languages?
aclanthology.org/R09-1077.pdf refer this
www.diva-portal.org/smash/get/diva2:1042595/FULLTEXT01.pdf this too
I enjoyed this lesson
I'm glad!
Keep grinding pal. Employ a company like Promo>SM!!
?
Excellent 👌
Thanks for watching. Subscribe to My Channel for More videos
@8:20 Will the CFG be given in the question itself ? 😓
It may or may not be given, depends on the paper setter
Thanks
can you maybe provide an answer for the moore maschine , so i know if im right
great explanation, welldone
Many thanks!
In the example 2 sir, how can we derive at least 15 strings from it?
pls help me on how can we POS tagging for amharic ethiopian language or semantic languages
aclanthology.org/R09-1077.pdf You can refer this pdf
www.diva-portal.org/smash/get/diva2:1042595/FULLTEXT01.pdf This one too
pls help me on how can we POS tagging for amharic ethiopian language or semantic languages
pls help me on how can we POS tagging for amharic ethiopian language or semantic languages
How can we perform POS tagging in Bangla Language? Reply me, Please!!!
@jahanur biswas You need to download the Indian corpus for which you can use the following command: nltk.download('indian') nltk.download('punkt') Then, place a variable(tagged_set) where pre-trained Indian corpus is stored(bangla.pos). From Bengali corpus read the Bengali sentence and put them variable word_set.
WELL EXPLAINED SIR
Thanks