Chomsky Normal Form
Duration: 6 min
This video lesson is available to enrolled students.
Inside: a video lesson and guided study material.
Module outline
- Database Management System: Basics of DBMS, ER Diagram, Relational Model & Functional Dependencies, Keys & Integrity Constraints, Normalization (1NF - BCNF), Decomposition Properties & 4NF, File Organization & Indexing, Relational Algebra, SQL, Relational Calculus, Transaction Management, Concurrency Control
- Discrete Mathematics: Set Theory, Relations, Functions, Graph Theory, Group Theory, Propositional and Predicate Logic
- Digital Electronics: Digital Systems & Boolean Basics, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Combinational Circuit, Sequential Circuits, Number System, Number Representation, Registers and Counters, Boolean Algebra and Logic Gates, Microprocessors and Microcontrollers, Logic Families and CMOS Logic, Microprocessors, Logic Gates and Boolean Algebra, Number Systems and Codes, Minimization of Boolean Functions, Timing, Hazards and Testing, Logic Families, Combinational Logic Design, Arithmetic Circuits, Semiconductor Memories and Programmable Logic Devices, Combinational Logic Circuits, Sequential Circuits and State Machines, Latches and Flip-Flops, Finite State Machines, Minimization of Boolean Functions, Arithmetic Circuits, Registers and Counters, Latches and Flip-Flops, Number Systems and Codes
- Computer Architecture: Basics of COA, Floating Point Rep, Cache Memory Organization, Input Output Organisation, Pipelining, Instr Formats & Modes, Control Unit Design, Semiconductor Memories and Programmable Logic, Processor Organization and Instructions, Memory Hierarchy and Input/Output
- Operating System: Introduction to OS, Process Management, CPU Scheduling, Process Synchronization, Deadlock, Virtual Memory, Disc Scheduling, File Management, Memory Management, Threads & Process Creation
- Computer Networks: Introduction to CN, DLL: Access Control, DLL: Flow Control, DLL: Error Control, DLL: Framing, Data Link Layer - Ethernet, Net Layer: IPv4 & Proto, Net Layer: IP Addressing, Net Layer:Routing Protocol, Transport Layer Services, TL: Congestion & UDP, Application Layer, Network Security, Hardware Basics
- Data Structures: Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing
- Algorithms: Algorithm Analysis, Sorting Algorithms, Greedy Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos, Time Complexity Analysis
- Theory Of Computation: Introduction to TOC, Deterministic FA (DFA), Non-Deterministic FA, Regular Expressions, Grammar, Regular Language Properties, Moore & Mealy Machines, Pushdown Automata & CFG, Turing Machines, Complexity Theory
- Compiler Design: Intro to Compilers, Lexical Analysis, Grammar & CFG, Syntax Analysis: Top-Down, Syntax Analysis: Bottom-Up, Semantic Analysis & SDT, Intermediate Code Gen, Code Optimization
- C language: C Fundamentals, Control Flow, Functions, Arrays & Pointers, Storage Classes, Structures & Enums
- Software Engineering: Fundamentals of Software Engineering, Software Requirements and Quality Assurance, Software Design, Estimation and Metrics, Software Testing, Software Maintenance and Configuration Management
- Emerging Trends & AI: Emerging Tech Trends, Artificial Intelligence, Cloud Computing, Internet of Things
- Computer Graphics: Basics of Computer Graphics, 2-D Geometrical Transforms and Viewing
- Aptitude: Percentage, Ratio and Proportion (Ratios), Logarithm, HCF LCM, Average, Sequence and Series (Series), Number System, Powers and Exponents (Surds and Indices), Algebra, Permutation and Combination, Probability, Profit and Loss, Simple Interest and Compound Interest, Pipe and Cistern, Speed Time and Distance, Mixture and Alligation, Mensuration and Geometry, Mental Ability, Age Problems, Partnership, Statistics, Data Interpretation, Arithmetic, Linear Algebra, Trigonometry, Percentages, Simplification and Approximation, Number System, Ratio and Proportion, Averages, Mixtures and Alligation, Permutations and Combinations, Profit, Loss and Discount, Sequences and Series, Vocabulary, Subject-Verb Agreement, Sentence Completion, Geometry, Reading Comprehension, Powers, Surds and Logarithms, Mathematical Operations, Alphabet and Word Tests, Transformation of Shapes, Signal Space and Optimum Detection, Constraint Puzzles, Mensuration, Patterns in Two-Dimensional Figures, Measurement and Quantity Take-Off, Three-Dimensional Patterns and Visualization, Numerical Reasoning, Sentence Structure and Correction, Critical Reasoning, Syllogisms and Venn Diagrams, Coding and Decoding, Series Completion, Order, Ranking and Sequence, Data Sufficiency, Differential Calculus, Wireless, Satellite and Optical Communication Systems, Complex Analysis, Vector Analysis, Trigonometry, Probability, Statistics, Differential Calculus, Algebra, Time and Work, Speed, Time and Distance, Data Interpretation, Combinatorics
- Reasoning: Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning), Series (Number and Letter Series) (Numerical Relations and Reasoning), Coding Decoding, Data Sufficiency, Syllogisms, Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning), Seating Arrangements, Blood Relations, Directions (Direction Test), Analytical Reasoning (Counting Figures Reasoning), Puzzle Solving (Puzzles), Calendar, Clock, Cubes & Dices, Selection Decision Table (Decision Making), Logical Sequence Of Words, Venn Diagram, Data Arrangement, Inequality, Analogy, Ranking, Order and Sequence, TCS NQT Advanced Reasoning Ability, Assembling and Grouping of Shapes, Cubes and Dice, Analogy and Classification, Direction Sense, Algebra, Logical Deduction and Induction, Speed, Time and Distance, Narrative Sequencing, Project Monitoring, Resources and Safety, Traverse Surveying, Time and Work, Clocks and Calendars, Data Interpretation, Blood Relations, Data Sufficiency
- English (Verbal Ability): Vocabulary, Noun, Pronoun, Adjectives, Preposition, Articles, Direct and Indirect Speech, Tenses, Conjunction, Subject Verb Agreement (Verb Noun Agreement), Modals, Sentence Re-arrangements (Para Jumbles) (Narrative Sequencing), Sentence Correction (Error Correction), Comprehension / Reading Comprehension / Unseen Passages (Critical Reasoning) (Paragraph Questions), Cloze Test (Cloze Passage), Verbal Analogy (Word Based Analogy), Adverb, Verb, Prepositions and Conjunctions, Idioms and Phrases, Verb Forms and Verb Patterns, Sentence Basics, Nouns and Pronouns, Adjectives and Adverbs, Articles and Determiners, Voice and Reported Speech, Modals, Conditionals and Subjunctive, Blood Relations, Tenses, Vocabulary
- Engineering Mathematics: Calculus, Vectors
- GATE Live Class Recordings 2026: GATE 2026 Live Class
AI summary & chapters
AI Summary
An AI-generated summary of this video lecture.
The lecture introduces the concept of Normalization for Context-Free Grammars (CFG), specifically focusing on Chomsky Normal Form (CNF). The instructor defines CNF as a state where every production rule follows the format A → BC or A → a, where B and C are non-terminals and a is a terminal. The session transitions into a practical demonstration using the grammar S → aSb / ab. The instructor systematically converts this grammar into CNF by introducing auxiliary non-terminals to replace terminals and breaking down right-hand sides that exceed length two. Finally, the lecture concludes by deriving a mathematical property: for any string of length n derived from a CNF grammar, the number of production steps required is exactly 2n - 1.
Chapters
0:00 – 2:00 00:00-02:00
The video begins with a slide titled 'Normalization of CFG'. The text defines Chomsky Normal Form, stating that a grammar G is in CNF if every production is in the form A → BC / a. Below this, the constraints are listed: B, C ∈ Vn (non-terminals) and a ∈ Σ (terminals). The instructor underlines the phrase 'Chomsky Normal Form' and uses red arrows to point to the components A, B, C, and a on the slide, emphasizing the structural requirements of the rule. He specifically highlights that B and C must be non-terminals from the set Vn, while a must be a terminal from the set Σ.
2:00 – 5:00 02:00-05:00
The instructor moves to a whiteboard example with the production S → aSb / ab. He explains that this is not in CNF because the right-hand side contains terminals mixed with non-terminals and has a length of three. He introduces new non-terminals A and B with productions A → a and B → b. He rewrites the main rule as S → ASB / AB. Since ASB has length three, he introduces a new variable S1 (written as SA or similar) to split it, creating S1 → AS. The final normalized grammar is listed as S → S1 B / AB, S1 → AS, A → a, and B → b. He emphasizes that every rule must now strictly follow the A → BC or A → a format.
5:00 – 6:29 05:00-06:29
The instructor discusses the relationship between string length and derivation steps. He writes |w| = n and states that for a CNF grammar, the number of productions needed is 2n - 1. He demonstrates this with a calculation: 2(4) - 1 = 7. He lists the sequence of sentential forms for a derivation of length 4: S, S1 B, ASB, aSB, aAB, aBb, ab. This confirms that there are exactly 7 steps, matching the formula. He circles the final string ab to show the result. The slide text reiterates that if a CFG is in CNF, the number of sentential forms for a string of length n is 2n - 1.
The lesson effectively bridges theory and practice. It begins by defining the rigid structural constraints of Chomsky Normal Form, ensuring productions are binary or unary. It then applies these constraints to normalize a specific grammar, demonstrating the necessary introduction of new variables to handle mixed terminals and long sequences. The session concludes by establishing a critical algorithmic property: the linear relationship between string length and derivation steps (2n - 1), which is fundamental for parsing algorithms like CYK.

