Yeah this is good learning. College is suffering and I understand not everyone can possess such gifts and talents, so thank you kindly for allowing us to witness yours.
Theoretical computer science helps us put limits on computation; If it cannot happen in the theoretical models, then it cannot happen in real life. Lydia does an AMAZING job at this. You are a gifted teacher Lydia!
thank you! Take my heart ❤ . Please make regular expression and it how to represent it as an nfa in next video. And again thank you so much for the effort !
i always find it difficult when the professors goes with the bookish description.... like learning the basic and understanding the topic is the base of your solution. thank you very much and please keep doing what you do!
03:00 yes it accepts single "1" but; It will also accept any input sequence that contains "1". Because of the unweighted path between starting node q0 and q4, anytime when you take "1" there will be a path to q5 which is a final state. So the condition of "1 in the third final position" becomes kind of inefective.
Yes I agree. There's a flaw in the NFA since it will not only accept 1 but will also accept the strings 11, 011 or 0101, which do not satisfy the language.
The video provides an in-depth explanation of Nondeterministic Finite Automata (NFAs) in contrast to Deterministic Finite Automata (DFAs). Here's a summary of the main points discussed: Definition and Differences: NFAs, unlike DFAs, can transition into zero or more states for each symbol in the input. This characteristic makes them nondeterministic, as their next state is not always predetermined. Examples and Acceptance Criteria: The video illustrates this concept through examples, including an NFA that accepts strings containing a '1' in the third position from the end. It highlights a key feature of NFAs: a string is accepted as long as there exists at least one path to an accept state, regardless of other possible paths that might lead to rejection. Transition on Empty String: NFAs can also transition on the empty string, meaning they can change states without consuming any input symbols. This adds flexibility in constructing NFAs for certain languages. Formal Definition: NFAs are defined as five-tuples, similar to DFAs, but with a transition function that can output a set of possible states instead of just one. This allows for multiple potential pathways through the automaton for a given input string. Equivalence with DFAs: Despite the structural differences, the video concludes that NFAs are not more powerful than DFAs. Any language recognized by an NFA can also be recognized by a DFA, meaning both can define the same set of regular languages. NFAs offer a more simplified construction for certain languages without increasing the computational power beyond that of DFAs. This explanation underscores the theoretical underpinnings of finite automata in computer science, particularly in the areas of language recognition and automata theory.
if an empty string is given as an input then the automata should directly jump to accept state looking at it, but it has two steps q4 and then q5. But where does the 1 input come in an empty string to take it from q4 to q5
The video answered my question - an NFA actually can remain in the same state on 1, OR transition on 1. Great videos, I hope you make more! You have a talent for teaching.
Man I've been trying to put my finger on your accent since the beginning of the series, and I think I finally got it. You grew up in India, but studied abroad/moved to the U.S., or work really hard to neutralize your indian accent. DId I get it right? 😜 Great series, btw
Yeah this is good learning. College is suffering and I understand not everyone can possess such gifts and talents, so thank you kindly for allowing us to witness yours.
100 times easier/more enjoyable for me to learn from these videos than from a university lecture....thank you
hey i'd just like to thank you for saving my semester
Your way of explaining both DFAs and NFAs is very clear and concise, thank you so much! :)
Thank you so much for putting effort into making this. You're amazing.
Theoretical computer science helps us put limits on computation; If it cannot happen in the theoretical models, then it cannot happen in real life. Lydia does an AMAZING job at this. You are a gifted teacher Lydia!
thank you! Take my heart ❤ . Please make regular expression and it how to represent it as an nfa in next video. And again thank you so much for the effort !
I'll get my whole college class to watch your playlist I Loved it
Your channel is helping me graduate. Thank you so much!
hey, these videos are GREAT
i always find it difficult when the professors goes with the bookish description.... like learning the basic and understanding the topic is the base of your solution. thank you very much and please keep doing what you do!
03:00 yes it accepts single "1" but; It will also accept any input sequence that contains "1". Because of the unweighted path between starting node q0 and q4, anytime when you take "1" there will be a path to q5 which is a final state. So the condition of "1 in the third final position" becomes kind of inefective.
Yes I agree. There's a flaw in the NFA since it will not only accept 1 but will also accept the strings 11, 011 or 0101, which do not satisfy the language.
No it won't accept the all strings that contain 1 but the only ones which ends with 1
you made it very easy to understand
This is a gold mine. Thank you for making this.
Thanks for the videos, explained very well
I saw all your videos...👌👌👌
thanks you saved my grade!
come back for explaining regular expressions too 😭🙏
such a good work!! Thank you very much
fascinating video
Awesome video, please do more. Thanks.
Hey how come you stopped making videos? Your videos are so clear and easy to understand.
The video provides an in-depth explanation of Nondeterministic Finite Automata (NFAs) in contrast to Deterministic Finite Automata (DFAs). Here's a summary of the main points discussed:
Definition and Differences: NFAs, unlike DFAs, can transition into zero or more states for each symbol in the input. This characteristic makes them nondeterministic, as their next state is not always predetermined.
Examples and Acceptance Criteria: The video illustrates this concept through examples, including an NFA that accepts strings containing a '1' in the third position from the end. It highlights a key feature of NFAs: a string is accepted as long as there exists at least one path to an accept state, regardless of other possible paths that might lead to rejection.
Transition on Empty String: NFAs can also transition on the empty string, meaning they can change states without consuming any input symbols. This adds flexibility in constructing NFAs for certain languages.
Formal Definition: NFAs are defined as five-tuples, similar to DFAs, but with a transition function that can output a set of possible states instead of just one. This allows for multiple potential pathways through the automaton for a given input string.
Equivalence with DFAs: Despite the structural differences, the video concludes that NFAs are not more powerful than DFAs. Any language recognized by an NFA can also be recognized by a DFA, meaning both can define the same set of regular languages. NFAs offer a more simplified construction for certain languages without increasing the computational power beyond that of DFAs.
This explanation underscores the theoretical underpinnings of finite automata in computer science, particularly in the areas of language recognition and automata theory.
Well done 👍🏻
Learned a lot thank
Thank you 🙏
if an empty string is given as an input then the automata should directly jump to accept state looking at it, but it has two steps q4 and then q5. But where does the 1 input come in an empty string to take it from q4 to q5
Very calm and cute voice hope you are doing good in life
Can you explain the subset costruction algorithm? Thank you
paying for university courses to come learn on youtube instead. smh. super helpful!
what is the input used for transition from q0 to q4 ?
you have saved me hours with scripts I do not understand. A question: why would DFA be used if there are NFAs? wouldn't that be always easier?
Thank you!!!!! Could you make one for converting NFA to DFA??
Eres la mejor
at 00:41, isn't this actually an NFA since there are several states which transition on both: 0,1 ? I thought a DFA must only transition on 1 or 0?
The video answered my question - an NFA actually can remain in the same state on 1, OR transition on 1. Great videos, I hope you make more! You have a talent for teaching.
thank you so much
0:38 Hmm, it doesn't accept 010100
Good catch 😂
the dfa doesn't accept 1110100 but i think it's in the language.
0:40 The DFA is wrong.
Man I've been trying to put my finger on your accent since the beginning of the series, and I think I finally got it. You grew up in India, but studied abroad/moved to the U.S., or work really hard to neutralize your indian accent.
DId I get it right? 😜
Great series, btw
Been following from the first video but somehow, I've failed to understand this😢
Design a deterministic finite automata
bro its pronounced aksept not assept