Chomsky Normal Form (CNF) in Theory of computation explained with following timestamps:
0:00 – Chomsky Normal Form - Theory of Computation
1:00 – Definition of Chomsky Normal Form (CNF)
2:22 – Algorithm for CFG to CNF
4:24 – Important note
5:02 – Example of CFG to CNF
 
Chomsky Normal Form (CNF) in Theory of computation explained with following points:
1. Chomsky Normal Form (CNF)
2. Useless Production
3. Removing of Useless Production

Also view:
Useless Production Removal[1] - https://www.youtube.com/watch?v=9TffL3Xz6-U
Useless Production Removal[2] - https://www.youtube.com/watch?v=ctaz3TGhRxM
Removal of Null Production - https://www.youtube.com/watch?v=V3uZecslcb4
Removal of Unit Production - https://www.youtube.com/watch?v=ejoNXsHrB18

Engineering Funda channel is all about Engineering and Technology. Here this video is a part of Theory of Computation.
 
#ChomskyNormalForm, #CNF, #NormalForm, #ContextFreeGrammar, #TOC​, #TheoryofComputation​, #AutomataTheory, #EngineeringFunda