Practice Question

Duration: 2 min

This video lesson is available to enrolled students.

Return to /learn/COAL-INDIA-MANAGEMENT-TRAINEE/theory-of-computation/regular-language-properties/closure-properties/asset-practice-question-4717 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 instructor presents three specific CFG options and systematically analyzes each one to determine if any terminal strings can be derived from the start symbol. He uses parse trees to visualize the derivation process. For the first option, he demonstrates that a valid string can be generated. For the second option, he identifies a non-terminal that lacks production rules, leading to the conclusion that it generates an empty language. Finally, he analyzes the third option, showing that it can generate strings through recursive derivations.

Chapters

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

    The instructor begins by reading the question: "Consider the following CFG and identify which of the following CFG generate Empty language?" He lists three options. Option 1 is S -> aAB / Aa, A -> a. He draws a parse tree for the production S -> Aa, substituting A with 'a' to get 'aa', marking it with a checkmark to show it generates a string. Next, he analyzes Option 2: S -> aAB, A -> a / b. He draws a tree starting with S -> aAB. He substitutes A with 'a' or 'b', but points out that the non-terminal 'B' has no production rules defined in this option. He marks 'B' with a cross, indicating the derivation cannot complete, thus generating an empty language. He then moves to Option 3: S -> aAB / aB, A -> aBb, B -> aA. He starts drawing a parse tree for S -> aAB, substituting A with aBb.

  2. 2:00 – 2:24 02:00-02:24

    Continuing with Option 3, the instructor expands the parse tree to show the recursive nature of the grammar. He substitutes B with aA, and then A again with aBb, creating a chain: S -> aAB -> a(aBb)B -> a(a(aA)b)B. He circles the non-terminal 'B' in the tree to highlight its role. He explains that since A and B can derive each other and eventually terminals (like 'a' and 'b'), this grammar generates strings and is not empty. He contrasts this with Option 2, where the undefined 'B' prevents any string generation. The lecture concludes by confirming that Option 2 is the correct answer for generating an empty language.

The key takeaway is that if a non-terminal in a derivation path has no production rules, the language generated by that path is empty. In this specific problem, Option 2 fails to generate strings because the non-terminal 'B' is undefined, whereas Options 1 and 3 have complete production rules allowing for string generation.

Loading lesson…