Theory of Computation
Theory of Computation. Instructor: Prof. Raghunath Tewari, Department of Computer Science and Engineering, IIT Kanpur. This is an introductory course on Theory of Computation intended for undergraduate students in computer science. In this course we will introduce various models of computation and study their power and limitations. We will also explore the properties of the corresponding language classes defined by these models and the relations between them. We will assume the student is comfortable in analytical reasoning and has preferably done a course on Data Structures and Algorithms. (from nptel.ac.in)
| Lecture 03 - Examples of DFAs |
This lecture covers the following examples of DFAs: 1. DFA that accepts binary strings with even number of 1s. 2. DFA that accepts strings of 'a' and 'b' that ends with substring 'ab'. 3. DFA that accepts binary strings whose decimal representation is divisible by 3.
Go to the Course Home or watch other lectures: