Learn · Introduction to Automata, Languages and Computation

Lecture 23 of 62WEEK 5

Lecture 23: Construction of regular expression from a DFA (example)

Prof. Sourav Mukhopadhyay · IIT Kharagpur

Credits and licence

From
Introduction to Automata, Languages and Computation, IIT Kharagpur (at NPTEL)
Licence
CC BY-NC-SA, as NPTEL states it. Non-commercial use only.
Attribution
NPTEL states: "Distributed under Creative Commons Attribution-ShareAlike / CC BY - NC - SA", beside a BY-NC-SA badge.
Who can watch
Tweens profiles and older. How courses are placed

All the lectures

  1. Lecture 1 : Deterministic Finite Automata (DFA) Video
  2. Lecture 2 : Input alphabet Video
  3. Lecture 3 : Extended transition function Video
  4. Lecture 4 : Language of DFA Video
  5. Lecture 5 : Building DFA Video
  6. Lecture 06:Building DFA (contd.) Video
  7. Lecture 07: NFA (Nondeterministic Finite Automata) Video
  8. Lecture 08: Language of a NFA Video
  9. Lecture 09: Equivalence of DFA's and NFA's Video
  10. Lecture 10: Subset Construction Video
  11. Lecture 11 : ϵ-NFA Video
  12. Lecture 12 : Extended transition function of 𝜖-NFA Video
  13. Lecture 13 : Language of 𝜖-NFA Video
  14. Lecture 14 : 𝜖-NFA to NFA Video
  15. Lecture 15 : 𝜖-NFA to DFA Video
  16. Lecture 16 : Regular expression Video
  17. Lecture 17 : Regular expression (Contd.) Video
  18. Lecture 18 : More on regular expression Video
  19. Lecture 19 : Equivalence of 𝜖-NFA and regular expression Video
  20. Lecture 20 : Equivalence of 𝜖-NFA and regular expression (Contd.) Video
  21. Lecture 21: DFA to Regular expression Video
  22. Lecture 22: DFA to Regular expression (Contd.) Video
  23. Lecture 23: Construction of regular expression from a DFA (example) Video
  24. Lecture 24: Closure properties of Regular Set Video
  25. Lecture 25: Closure properties of Regular Set (Contd.) Video
  26. Lecture 26 : Substitution Video
  27. Lecture 27 : Pumping Lemma Video
  28. Lecture 28 : Application of the pumping lemma Video
  29. Lecture 29 : More on Pumping lemma Video
  30. Lecture 30 : Arden's Theorem Video
  31. Lecture 31: Minimization of FA Video
  32. Lecture 32: Minimization of FA (Cont.) Video
  33. Lecture 33: Two way FA Video
  34. Lecture 34: Finite automata with output Video
  35. Lecture 35: Equivalence of Moore and Mealy machine Video
  36. Lecture 36: Context free grammars (CFG) Video
  37. Lecture 37: Context free language (CFL) Video
  38. Lecture 38: More example on CFL Video
  39. Lecture 39: More on CFG Video
  40. Lecture 40: Derivation Tree/Parse Tree Video
  41. Lecture 41 : Leftmost and Rightmost derivations Video
  42. Lecture 42 : Ambiguity in CFG Video
  43. Lecture 43 : Simplification of CFG Video
  44. Lecture 44 : Algorithms to construct reduced grammar Video
  45. Lecture 45 : Elimination of Null and Unit productions Video
  46. Lecture 46 : Chomsky Normal Form (CNF) Video
  47. Lecture 47 : Greibach Normal Form (GNF) Video
  48. Lecture 48 : Pushdown Automata (PDA) Video
  49. Lecture 49 : Language accepted by PDA Video
  50. Lecture 50 : Example of a language accepted by PDA Video
  51. Lecture 51 : Deterministic PDA Video
  52. Lecture 52 : Equivalence of language accepted Video
  53. Lecture 53 : Equivalence PDA Video
  54. Lecture 54 : Equivalence PDA and CFL Video
  55. Lecture 55 : Equivalence PDA and CFL (Contd.) Video
  56. Lecture 56: Relationship between regular language and CFL Video
  57. Lecture 57: Pumping lemma for CFLs Video
  58. Lecture 58: Closer properties of CFLs Video
  59. Lecture 59: Turning Machine Video
  60. Lecture 60: Language accepted by a Turning machine Video
  61. Live Session 24-02-2021 Video
  62. Live Session 26-03-2021 Video