NDFA where 3 symbol from right end is a

Duration: 5 min

This video lesson is available to enrolled students.

Return to /learn/COAL-INDIA-MANAGEMENT-TRAINEE/theory-of-computation/non-deterministic-fa/nfa-basics-design/asset-ndfa-where-3-symbol-from-right-end-is-a 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 video presents an educational lecture on automata theory, focusing on the design of an NDFA. The core problem displayed is: "Design a NDFA that accepts all strings over the alphabet $\Sigma = \{a, b\}$ such that for every accepted string 3rd from right end is always a." The instructor begins by analyzing the problem requirements. He starts by drawing a preliminary state diagram on the top left quadrant. This initial attempt involves a sequence of states $q_0, q_1, q_2$ where transitions are labeled with input symbols. He quickly modifies this by adding a transition from $q_1$ to a new state $q_3$ with a self-loop, suggesting an exploration of how to handle different input characters at specific positions.

Chapters

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

    The video opens with the problem statement. The instructor begins drawing the first NDFA attempt. He draws a circle for state $q_0$ with an incoming arrow indicating the start. He draws a transition to state $q_1$ labeled "$a, b$". From $q_1$, he draws a transition to state $q_2$ labeled "$b$" and marks $q_2$ with a double circle to indicate it is an accepting state. He then adds a transition from $q_1$ to a new state $q_3$ labeled "$a$" and draws a self-loop on $q_3$ labeled "$a, b$". He writes "x b x x x" below this diagram, likely testing a string where 'b' is at the 3rd position from the right to see if it gets rejected or accepted.

  2. 2:00 – 5:00 02:00-05:00

    The instructor moves to the top right quadrant to draw a second attempt. He draws states $q_0, q_1, q_2$ in a line. Transitions are $q_0 \xrightarrow{a,b} q_1$ and $q_1 \xrightarrow{b} q_2$ (accepting). He writes "x b x x x" again. Then, he moves to the bottom left to draw a more complex graph. He draws a self-loop on $q_0$ labeled "$a$". He then moves to the bottom right to draw the final, most refined diagram. This diagram shows $q_0$ with a self-loop labeled "$a, b$". From $q_0$, there is a transition to $q_1$ labeled "$b$". From $q_1$, a transition to $q_2$ labeled "$a, b$". From $q_2$, a transition to $q_3$ (accepting) labeled "$a$". He writes "x x x b - -" below this, possibly indicating a string ending in 'b' at the 3rd position which should be rejected.

  3. 5:00 – 5:10 05:00-05:10

    The video ends with the instructor pointing at the final diagram on the bottom right. He gestures towards the transitions, specifically the path from $q_0$ through $q_1, q_2$ to the accepting state $q_3$. The diagram represents the logic of guessing the position of the 'a' character from the right. The self-loop on $q_0$ allows the machine to consume any prefix before the critical 'a'. The subsequent chain of states ensures that exactly two characters follow the guessed 'a' before reaching the accepting state.

The lecture demonstrates the iterative process of automata design. The instructor shows the trial-and-error phase, drawing multiple diagrams to explore transition logic. He uses example strings on the board to validate state transitions. The progression from a simple linear chain to a diagram with self-loops highlights the key concept of NDFA: the ability to guess the correct path. The final diagram encapsulates the standard solution for "k-th from right" problems, where the machine non-deterministically guesses the target character and verifies the suffix length.

Loading lesson…