Understanding NFA: Formal Description & Accepted Languages in Automata Theory π
Explore the formal definition of NFA, the languages it accepts, and their classification as regular languages in this lecture by Prof. Somenath Biswas from IIT Kanpur. Perfect for students and enthusiasts of automata theory!

nptelhrd
17.0K views β’ Jun 27, 2014

About this video
Theory of Computation by Prof. Somenath Biswas,Computer Science and Engineering, IIT Kanpur.For more details on NPTEL visit http://nptel.ac.in
Tags and Topics
Browse our collection to discover more content in these categories.
Video Information
Views
17.0K
Likes
118
Duration
55:04
Published
Jun 27, 2014
User Reviews
4.2
(3)