# Introduction to Automata, Languages and Computation

- Institution: IIT Kharagpur
- Department: Computer Science and Engineering
- Teacher: Prof. Sourav Mukhopadhyay
- Level: Undergraduate
- Language: English
- Subjects: Computer science, Engineering
- Source: [NPTEL](https://nptel.ac.in/courses/106105196)
- Licence: [CC BY-NC-SA](https://nptel.ac.in/faq) (Non-commercial use only.)
- Syllabus: [at the source](https://nptel.ac.in/courses/106105196)
- Who can watch: Tweens profiles and older (sources give no ratings; placed by Invisible Network from the source's own words)

## Lectures

1. [Lecture 1 : Deterministic Finite Automata (DFA)](https://invisiblenetwork.ai/learn/nptel/106105196/80b1bcff5f1f) (Video)
2. [Lecture 2 : Input alphabet](https://invisiblenetwork.ai/learn/nptel/106105196/02ddac706c1e) (Video)
3. [Lecture 3 : Extended transition function](https://invisiblenetwork.ai/learn/nptel/106105196/3d2f0fa5baa5) (Video)
4. [Lecture 4 : Language of DFA](https://invisiblenetwork.ai/learn/nptel/106105196/281440e1c6a8) (Video)
5. [Lecture 5 : Building DFA](https://invisiblenetwork.ai/learn/nptel/106105196/c8978a631410) (Video)
6. [Lecture 06:Building DFA (contd.)](https://invisiblenetwork.ai/learn/nptel/106105196/184beb11a996) (Video)
7. [Lecture 07: NFA (Nondeterministic Finite Automata)](https://invisiblenetwork.ai/learn/nptel/106105196/feddbf81fc65) (Video)
8. [Lecture 08: Language of a NFA](https://invisiblenetwork.ai/learn/nptel/106105196/faf9e4ab55a3) (Video)
9. [Lecture 09: Equivalence of DFA's and NFA's](https://invisiblenetwork.ai/learn/nptel/106105196/86f2b3578825) (Video)
10. [Lecture 10: Subset Construction](https://invisiblenetwork.ai/learn/nptel/106105196/0a4cb5f667c8) (Video)
11. [Lecture 11 : ϵ-NFA](https://invisiblenetwork.ai/learn/nptel/106105196/e2cbd767458e) (Video)
12. [Lecture 12 : Extended transition function of 𝜖-NFA](https://invisiblenetwork.ai/learn/nptel/106105196/a90a751e330a) (Video)
13. [Lecture 13 : Language of 𝜖-NFA](https://invisiblenetwork.ai/learn/nptel/106105196/f254b5e67aa2) (Video)
14. [Lecture 14 : 𝜖-NFA to NFA](https://invisiblenetwork.ai/learn/nptel/106105196/5680fc179e91) (Video)
15. [Lecture 15 : 𝜖-NFA to DFA](https://invisiblenetwork.ai/learn/nptel/106105196/96e0736b5679) (Video)
16. [Lecture 16 : Regular expression](https://invisiblenetwork.ai/learn/nptel/106105196/2645e6fab7fe) (Video)
17. [Lecture 17 : Regular expression (Contd.)](https://invisiblenetwork.ai/learn/nptel/106105196/6534124f0fbd) (Video)
18. [Lecture 18 : More on regular expression](https://invisiblenetwork.ai/learn/nptel/106105196/b04b755d0c3a) (Video)
19. [Lecture 19 : Equivalence of 𝜖-NFA and regular expression](https://invisiblenetwork.ai/learn/nptel/106105196/1ea4aac9e5c5) (Video)
20. [Lecture 20 : Equivalence of 𝜖-NFA and regular expression (Contd.)](https://invisiblenetwork.ai/learn/nptel/106105196/988015975df3) (Video)
21. [Lecture 21: DFA to Regular expression](https://invisiblenetwork.ai/learn/nptel/106105196/efdfebc9c0c0) (Video)
22. [Lecture 22: DFA to Regular expression (Contd.)](https://invisiblenetwork.ai/learn/nptel/106105196/f59126c7cd49) (Video)
23. [Lecture 23: Construction of regular expression from a DFA (example)](https://invisiblenetwork.ai/learn/nptel/106105196/29973ce5628f) (Video)
24. [Lecture 24: Closure properties of Regular Set](https://invisiblenetwork.ai/learn/nptel/106105196/b821858f5704) (Video)
25. [Lecture 25: Closure properties of Regular Set (Contd.)](https://invisiblenetwork.ai/learn/nptel/106105196/fe916cac6601) (Video)
26. [Lecture 26 : Substitution](https://invisiblenetwork.ai/learn/nptel/106105196/685cfd0f51ec) (Video)
27. [Lecture 27 : Pumping Lemma](https://invisiblenetwork.ai/learn/nptel/106105196/3990dda29243) (Video)
28. [Lecture 28 : Application of the pumping lemma](https://invisiblenetwork.ai/learn/nptel/106105196/8d0dc14787ab) (Video)
29. [Lecture 29 : More on Pumping lemma](https://invisiblenetwork.ai/learn/nptel/106105196/0b64e11a4010) (Video)
30. [Lecture 30 : Arden's Theorem](https://invisiblenetwork.ai/learn/nptel/106105196/1adf14558b63) (Video)
31. [Lecture 31: Minimization of FA](https://invisiblenetwork.ai/learn/nptel/106105196/3a7f92c82d04) (Video)
32. [Lecture 32: Minimization of FA (Cont.)](https://invisiblenetwork.ai/learn/nptel/106105196/2661238e3929) (Video)
33. [Lecture 33: Two way FA](https://invisiblenetwork.ai/learn/nptel/106105196/1232fb959774) (Video)
34. [Lecture 34: Finite automata with output](https://invisiblenetwork.ai/learn/nptel/106105196/820ed7a095d0) (Video)
35. [Lecture 35: Equivalence of Moore and Mealy machine](https://invisiblenetwork.ai/learn/nptel/106105196/1945732cd2c6) (Video)
36. [Lecture 36: Context free grammars (CFG)](https://invisiblenetwork.ai/learn/nptel/106105196/67263befbf38) (Video)
37. [Lecture 37: Context free language (CFL)](https://invisiblenetwork.ai/learn/nptel/106105196/79090b4902ef) (Video)
38. [Lecture 38: More example on CFL](https://invisiblenetwork.ai/learn/nptel/106105196/c6e0bbab451e) (Video)
39. [Lecture 39: More on CFG](https://invisiblenetwork.ai/learn/nptel/106105196/2dde3f311529) (Video)
40. [Lecture 40: Derivation Tree/Parse Tree](https://invisiblenetwork.ai/learn/nptel/106105196/f025bf50e1b9) (Video)
41. [Lecture 41 : Leftmost and Rightmost derivations](https://invisiblenetwork.ai/learn/nptel/106105196/2a71f685afd9) (Video)
42. [Lecture 42 : Ambiguity in CFG](https://invisiblenetwork.ai/learn/nptel/106105196/18799e95375f) (Video)
43. [Lecture 43 : Simplification of CFG](https://invisiblenetwork.ai/learn/nptel/106105196/d1bd0f13435f) (Video)
44. [Lecture 44 : Algorithms to construct reduced grammar](https://invisiblenetwork.ai/learn/nptel/106105196/3777f0c594aa) (Video)
45. [Lecture 45 : Elimination of Null and Unit productions](https://invisiblenetwork.ai/learn/nptel/106105196/2e3137aa2c0b) (Video)
46. [Lecture 46 : Chomsky Normal Form (CNF)](https://invisiblenetwork.ai/learn/nptel/106105196/3cb976d747e5) (Video)
47. [Lecture 47 : Greibach Normal Form (GNF)](https://invisiblenetwork.ai/learn/nptel/106105196/1eaf41ca66f0) (Video)
48. [Lecture 48 : Pushdown Automata (PDA)](https://invisiblenetwork.ai/learn/nptel/106105196/7492f643fd86) (Video)
49. [Lecture 49 : Language accepted by PDA](https://invisiblenetwork.ai/learn/nptel/106105196/292983b5eaca) (Video)
50. [Lecture 50 : Example of a language accepted by PDA](https://invisiblenetwork.ai/learn/nptel/106105196/a0eef20a8a06) (Video)
51. [Lecture 51 : Deterministic PDA](https://invisiblenetwork.ai/learn/nptel/106105196/492eea958ec1) (Video)
52. [Lecture 52 : Equivalence of language accepted](https://invisiblenetwork.ai/learn/nptel/106105196/1e56afbe895d) (Video)
53. [Lecture 53 : Equivalence PDA](https://invisiblenetwork.ai/learn/nptel/106105196/a28a88281758) (Video)
54. [Lecture 54 : Equivalence PDA and CFL](https://invisiblenetwork.ai/learn/nptel/106105196/b6944c7512f2) (Video)
55. [Lecture 55 : Equivalence PDA and CFL (Contd.)](https://invisiblenetwork.ai/learn/nptel/106105196/23aeebaf73b2) (Video)
56. [Lecture 56: Relationship between regular language and CFL](https://invisiblenetwork.ai/learn/nptel/106105196/f4a0cc13aa74) (Video)
57. [Lecture 57: Pumping lemma for CFLs](https://invisiblenetwork.ai/learn/nptel/106105196/80770dc52d41) (Video)
58. [Lecture 58: Closer properties of CFLs](https://invisiblenetwork.ai/learn/nptel/106105196/4045c77faf4a) (Video)
59. [Lecture 59: Turning Machine](https://invisiblenetwork.ai/learn/nptel/106105196/32daf9540c72) (Video)
60. [Lecture 60: Language accepted by a Turning machine](https://invisiblenetwork.ai/learn/nptel/106105196/0bf1c77713e2) (Video)
61. [Live Session 24-02-2021](https://invisiblenetwork.ai/learn/nptel/106105196/80b1bcff5f1f-2) (Video)
62. [Live Session 26-03-2021](https://invisiblenetwork.ai/learn/nptel/106105196/02ddac706c1e-2) (Video)