Finite State Machine (Prerequisites)
ฝัง
- เผยแพร่เมื่อ 5 ต.ค. 2024
- TOC: The prerequisites of Finite State machine (FSM) in Theory of Computation.
Topics discussed:
1. Symbols in FSM.
2. Alphabets in FSM.
3. Strings in FSM.
4. Languages in FSM.
5. Powers of sigma in FSM.
6. Cardinality in FSM.
Full Course on TOC: goo.gl/f4CmJw
Follow Neso Academy on Instagram: @nesoacademy (bit.ly/2XP63OE)
Follow me on Instagram: @jaiz_itech (bit.ly/2M3xyOa)
Contribute: www.nesoacademy...
Memberships: bit.ly/2U7YSPI
Books: www.nesoacademy...
Website ► www.nesoacademy...
Forum ► forum.nesoacad...
Facebook ► goo.gl/Nt0PmB
Twitter ► / nesoacademy
Music:
Axol x Alex Skrindo - You [NCS Release]
#TheoryOfComputation #TOCByNeso #FiniteStateMachine #FSM #AutomataTheory
![[Live] : ONE FIGHT NIGHT 25 วันนี้!! "อเล็กซิส vs รีเกียน"](http://i.ytimg.com/vi/suVr9a6BM2g/mqdefault.jpg)
I am doing engineering rn, once I get my first salary after graduation, I promise I will donate. You have helped me so much. I paid so much money to my college but they don’t even come close.
Edit: I have graduated and got a job now. I give 100% credit for channels like you and 0% to my useless professors. I am glad to donate to you guys it’s nothing compared to what I have received in return.
Same, Good luck!
me too, f**k this good video!
@@saifh3681 i'm From Bangladesh
@@saifh3681 South Africa
@@saifh3681 Philippines!
Dude you don't need to thank us for watching... viewers should be thankful to you for teaching this, on top of that for FREE!
to all, guys have patience this subject look a little boring but this guy is teaching it really well
Yes bhai but sir ka explanation bhaut clear he 👍😌
Yeah dude... My college lecture way way more boring.... This video is like gift from god
@@sid7_lol for real !!!
@@sid7_lol mine can't even retain the students inside the call...
Ok
The technology is beautiful. So are people. It helped me for my exam without a pen-book preparation. ❤️
Thanks for uploading this kind of tutorial! It was worth my15+ minutes. It inspires us wannabe future programmers to be dedicated more in studying and learning. Salute!
I follow your video one by one, I feel all my difficulties to learn this concept all these years, now become more easier to understand, thank you sir
Today I'm start to learn this subject best of the best.. keep it up.... And thank you very much for helping others... People are awesome to help others.
This is really helpful! Thank you for your hard work preparing this course
These lectures are incredible. Excellent job sir!
Thank you from Brazil.
Very helpful and easy to understand
i hope to do better in this course, because of late it has been a challenge
I am doing engineering rn, once I get my first salary after graduation, I promise I will donate. You have helped me so much. I paid so much money to my college but they don’t even come close.
Thanks, sir..
Your tutorial helped me in getting 90/100. Salute to your efforts..
❤️
😀
Thank you so much... this made it clear for me the regular expression and theory of automata. (was really a difficult subject)
o man im in love with his voice
Well explained. Could you please explain also on kleen star, logics and sets as well.
Amazing video! Everyone should watch it for a solid grasp on competition theory. Huge thanks to the Sir for the clarity! 🙌
your teaching approach is perfect , thank you
Explation is awesom sr...i love ur way of teaching....
Neso is the best online academy the world of computing has ever produced. You are incredibly wonderful. When are you providing similar stuff for algorithm and full Python topics? I don't enjoy learning it in anywhere other than this academy. Please make a move soon
U teach so damn good!!! With you i will pass my FLAT class
When I was earning my master's degree, I heard a lot about finite state machines (FSMs), but it was all theory - like clouds in the sky: there's a lot of water, but you can't drink it. I toiled for three months after graduating until I implemented my first FSM in code in 1981. Now, there is a programming methodology based on this concept - v-agent oriented programming (VAOP) - with many examples of its implementation. It's best to start learning about VAOP with this article on Medium: "Bagels and Muffins of Programming or How Easy It Is to Convert a Bagel into a Black Hole".
With VAOP, you can implement FSM in any programming language.
This channel constantly encourages us to rebel against our professors!
Thanks for making our life easier! :)
You sir, is a legend
Sir, Your way of learning is good.
love ur videos......really it seems so difficult i thought ...but now i think i m wrong
Small remark on cardinality of epsilon. In the case that epsilon = { 0, 1 } then the cardinality of epsilon is indeed 2^n but that two is not a constant that is correct for any value of epsilon. The correct definition for cardinality of epsilon^n is (cardinality epsilon) ^ n.
only now I became clear on how the cardinality of a set = 2^n. wowwww....
Once I complete my graduation and start earning, I would love to donate to you guys. You are teaching more than my college did.
In this video first say set of all strings are languages, sigma represents alphabet ,alphabet is a collection of symbol but you in 8:48 said that sigma is a set of all strings
GOD gifted video for AT learning students
Love you Sir from Bangladesh......It would be nice if my Sir always taught like you in my university
Thank you all your hard work and the best explain. You are the best professor !You have helped me so much! you are incredible instructor! thank you , thank you , thank you!
You’re my indian friend who is the hero before the exam. Thanks a lot my dear hero , i owe you
Thank you❤ sir
15:19 amazing explanation! ♥💙
Now I'll be able to score better....finally you people came back !! :)
sir plz upload videos for compiler design tooo
Ya...
question:- is their can be any case when power of sigma will be an infinite set.
Thanks for uploading this kind of tutorial! It was worth my15+ minutes. It inspires us wannabe future programmers to be dedicated more in studying and learning. Salute!
😄
Very clear, thank you!!
Nicely Explained..
This is my very favourite subject . In this subject I got 92 % in SYCS
Sir. You are saving my skin!!!
Thanks a lot sir
It's helping me
very nice explanations, thanks
Truth:my teacher plays your videos in lectures.
Excellent Explanation Sir 👍👍👍👍👍
Thank you Sir
Thanks!
This took some time to get along but its really a good subject for me
Thanks for the great explanation. Question: Can a DFA accept an empty word as input (ie Power of zero)?
Yes
Thankyou !!
Thank you sir..thank you very much..
loved it absolutely.
How can E^*(Sigma star) be infinite for a given value of n.
For example if n=2 it is just union of first 3 terms(sigma 0 union sigma 1 union sigma 2) which is finite right
Thank you so much.
great lecture thnk u sr..
really good, love it
Sir plz upload videos on complier design and ai
Very nicely explained
Really u r best .Till now.😉
Life saving my CSE355!
I wont attend classes this channel is it am having notes from your lectures and sure about the sgpa 9 with your help thankyou
Sir, can a combination of alphabets and numbers can also be referred to as string?
Prereq of FSM:
Symbol, Alphabets, strings, language
Powers of Sigma
Cardinaltiy:
Iteration (an infinite set)
Amal jariyah...very good
Thank you..
Sir sigm power n and sigma star mai difference kya h ye to same h dono
Played it on 1.75x😁😁, but loved it..!! 💓
played it on 2x😅
in the collection of symbols, we can have such kind of sequence like {a,1,b,3} or can a and 1 be together in a
the sequence of symbols?
kya lecture hai sirrrr thank you 😊
I can't understand how it infinite in last plz tell me
Thankyou sir
That was so interesting thank you so much
Thanks so much!!!
thank you
is it also based on AKTU syllabus
Any Cpers here to study for the exam?
We met again in the different dimension😁...
Hoping to meet soon in our home ground cf after the exams.
it was really helpfull...
thanks a lot
sir you said everyday 1 lecture, but only two lectures till now
You are life saver
Thank you sir😊
can we say that power of an alphabet (sigma) results in a language (set of strings)?
Thanks a lot respected sir love from muzaffer garh Pakistan
Hello in alphabet section( a,b,c,1,o ) is also alphabet na
Good
Is your lecture sufficient for gate
Thank you so much！
Thanks man!
Set of all strings of length 0 is given as {€}, but shouldn't it be € only?
\epsilon is the unique string of length zero, {\epsilon} is the set containing the unique string of length zero!
Are these lectures good/enough for GATE?
Isn't the cardinality formula specific to the example?
U r the best ❤.
I am a math major...I love this Chann for CS.I want to learn theoretical computer science...can anyone suggest something?
At 12:30, Sigma0= Set of all strings of length 0= {epsilon}. Then how come the cardinality of Sigma0= 1 (as there are no elements).
Because 2^0 is 1
For 0 length string why can't we write phi?? What is the difference between epsilon and phi??
Basically in terms of toc epsilon is used to denote empty set
Or empty string
very useful
Can u guys Pls Upload DAA lectures as well..??? Pls
00:07 Understanding symbols and alphabets
01:54 Alphabet, String, Language Definitions
04:06 Understanding the set of all strings of different lengths over given alphabets
06:28 Finite State Machine language defined as a set of strings over alphabets.
08:26 Understanding Sigma Powers
10:25 Understanding powers of Sigma and cardinality
12:17 Cardinality of Sigma power n is 2^n
13:52 Finite State Machine Prerequisites
What if i said explicitly that an alphabet is a FINITE collection of symbols. Just coz alphabets should be finite sets. And for the string too, what if i add the finite part. Lots of books try to differentiate between a mathematical sequence and a string. eg and 1234 are both sequences but the later is a string. We exclude the ","s. Ref: (Language of Machines). Anyway i appreciate ur efforts