In this video, i have explained Non Deterministic Finite Automata (NFA) with following timecodes:
0:00 – Theory of Computation Lecture Series
0:33 – Example [Finite Language]
3:25 – Pictorial representation of NFA
6:33 – Multi transition in NFA
7:36 – Condition for a language to be Infinite
8:34 – Example [Infinite Language]
Following points are covered in this video:
1. Non-Deterministic Finite Automata (NFA)
2. Examples of Non-Deterministic Finite Automata (NFA)
3. Finite Language
4. Infinite Language

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

#FiniteAutomata, #FiniteAutomataExamples, #NonDeterministicFiniteAutomata, #NFA, #ExamplesofNonDeterministicFiniteAutomata, #ExamplesofNFA, #FiniteLanguage, #InfiniteLanguage, #TOC, #TheoryofComputation