Equivalence between two Grammar

Duration: 3 min

This video lesson is available to enrolled students.

Return to /learn/COAL-INDIA-MANAGEMENT-TRAINEE/theory-of-computation/grammar/chomsky-basics/asset-equivalence-between-two-grammar after enrolling

Inside: a video lesson and guided study material.

Module outline

  1. About Course: About the Course
  2. Paper-2 | Programming & Data Structures: C Fundamentals, Control Flow, Functions, Arrays & Pointers, Storage Classes, Structures & Enums, DMA, Macros, Scoping & File Handling, Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing
  3. Paper-2 | Databases / DBMS & SQL: 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
  4. Paper-2 | Algorithms: Algorithm Analysis, Time Complexity Analysis, Sorting Algorithms, Greedy Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos
  5. Paper-2 | Computer Networks & Security: Introduction to CN, Data Communication, 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, Hardware Basics, Network Access Technologies, Network Security
  6. Paper-2 | Digital Logic: Digital Systems & Boolean Basics, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Combinational Circuit, Sequential Circuits, Number System, Number Representation, Floating Point Rep
  7. Paper-2 | Operating System: Introduction to OS, Process Management, CPU Scheduling, Process Synchronization, Threads & Process Creation, Deadlock, Memory Management, Virtual Memory, Disc Scheduling, File Management
  8. Paper-2 | 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
  9. Paper-2 | Computer Organization & Architecture: Basics of COA, Cache Memory Organization, Input Output Organisation, Pipelining, Instr Formats & Modes, Control Unit Design, Programming the Basic Computer
  10. Paper-2 | 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, Run Time Environment
  11. Paper-1 | General Awareness: Polity, Physics, Biology, Chemistry, Static General Knowledge, GK- Current Affairs, History, Geography, Indian Economy, Environment
  12. Paper-1 | Logical Reasoning: Series (Number and Letter Series) (Numerical Relations and Reasoning), Coding Decoding, Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning), Data Interpretation, Blood Relations, Syllogisms, Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning), Selection Decision Table (Decision Making), Clock, Calendar, Cubes & Dices, Directions (Direction Test), Analogy, Seating Arrangements, Analytical Reasoning (Counting Figures Reasoning)
  13. Paper-1 | Quantitative Aptitude: Ratio and Proportion (Ratios), Mixture and Alligation, Permutation and Combination, Number System, HCF LCM, Speed Time and Distance, Average, Age Problems, Percentage, Profit and Loss, Time and Work, Pipe and Cistern, Simple Interest and Compound Interest, Powers and Exponents (Surds and Indices), Mensuration and Geometry, Probability, Statistics, Arithmetic, Algebra
  14. Paper-1 | English: Vocabulary, Comprehension / Reading Comprehension / Unseen Passages (Critical Reasoning) (Paragraph Questions), Sentence Re-arrangements (Para Jumbles) (Narrative Sequencing), Sentence Correction (Error Correction), Sentence Completion (Fill in the blanks), Sentence Construction, Cloze Test (Cloze Passage)
  15. Coal India Previous Year Paper:
  16. Engineering Mathematics: Set Theory, Relations, Functions, Graph Theory, Group Theory, Propositional and Predicate Logic, Linear Algebra, Calculus
  17. Coal India Mock Test:
AI summary & chapters

AI Summary

An AI-generated summary of this video lecture.

The lecture focuses on the concept of language equivalence in formal grammars within the context of automata theory. The instructor defines the language of a grammar, L(G), as the set of all terminal strings derived from the start symbol S. He establishes a critical criterion: two grammars, G1 and G2, are considered equivalent if and only if they generate the exact same language, mathematically expressed as L(G1) = L(G2). The lesson progresses to practical examples, contrasting complex grammars with simpler ones to demonstrate that different production rules can yield identical languages, a concept applicable to machines and regular expressions as well.

Chapters

  1. 0:00 – 2:00 00:00-02:00

    The instructor introduces the formal definition of language equivalence. On-screen text clearly states "G1 and G2 are equivalent if L (G1) = L (G2)." He writes "L(M1) = L(M2)" and "L(RE1) = L(RE2)" on the board to generalize the concept to machines and regular expressions. He begins constructing a specific grammar example on the whiteboard: S -> AB, A -> a, B -> b. He draws a derivation tree showing how S expands to AB, then to a and b, resulting in the string "ab". He explicitly writes L = { ab } and notes that the empty string is not part of this language, underlining the importance of the generated set.

  2. 2:00 – 3:27 02:00-03:27

    The instructor introduces a second, simpler grammar to compare against the first. He writes S -> ab as the production rule for this new grammar. He labels the first grammar G1 and the second G2. He draws a diagram illustrating that both G1 and G2 point to the same resulting language L. He emphasizes that despite the structural differences—one using non-terminals and the other a direct terminal string—both grammars generate the identical language {ab}. This visual comparison reinforces the core definition that equivalence depends solely on the generated language, not the complexity of the grammar rules. He underlines the text "G1 and G2 are equivalent if L (G1) = L (G2)" to stress the point.

The video effectively bridges theoretical definitions with concrete examples. By defining equivalence as L(G1) = L(G2), the instructor clarifies that the internal structure of a grammar is secondary to its output. The transition from a multi-step derivation (S -> AB -> ab) to a direct production (S -> ab) serves as a powerful demonstration that distinct grammatical structures can be functionally identical in terms of the language they produce. This sets the stage for understanding that multiple grammars can describe the same formal language.

Loading lesson…