In this video, i have explained Non Deterministic Finite Automata Examples with following timecodes:
0:00 – Theory of Computation Lecture Series
0:15 – Example-6 [Match language with given NFA]
4:27 – Tracing an accepting word
5:29 – Example-7
7:18 – Accepting words of Example-7
9:00 – Important Note-6
9:12 – Tracing a non-accepting word
10:53 – Important Note-7

Following points are covered in this video:
1. Non Deterministic Finite Automata Example (NFA)
2. NFA Examples
3. NFA & Language equivalence
4. NFA accepting words
5. NFA non-accepting words

Engineering Funda channel is all about Engineering and Technology. Here this video is a part of Theory of Computation.

#NFA, #NFAExamples, #NonDeterministicFiniteAutomata, #LanguageEquivalence, #NFAacceptingwords, #NFAnonacceptingwords, #TOC, #TheoryofComputation