NDFA Designing where every string ends with substring s
Duration: 7 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 video lecture focuses on the theoretical computer science topic of automata theory, specifically designing a Nondeterministic Finite Automaton (NFA). The instructor presents a problem statement displayed on the screen: "Design a NFA that accepts all strings over the alphabet $\Sigma = \{a, b\}$ where every accepted string 'w' ends with substring 's', Where s = bab". He begins by clarifying the requirement, emphasizing that the string must terminate with the specific sequence "bab". He writes down valid examples on the whiteboard, such as "bab", "abab", and "bbab", to illustrate the language. The core of the lecture involves constructing the state diagram step-by-step, starting with the initial state and building the path for the suffix, then adding the necessary transitions to handle arbitrary prefixes. The instructor uses a whiteboard and marker to draw the states and transitions, providing a visual aid for the students.
Chapters
0:00 – 2:00 00:00-02:00
The instructor starts by reading the problem statement from the whiteboard, which is clearly visible at the top of the screen. He underlines the phrase "ends with substring 's'" to stress the condition. He then writes down specific examples of strings that belong to the language: "bab", "abab", and "bbab". He explains that any string ending in "bab" is acceptable, regardless of what comes before it. He begins the visual construction by drawing a circle to represent the start state, labeling it $q_0$, and drawing an incoming arrow to indicate it is the initial state. He mentions that the alphabet is $\Sigma = \{a, b\}$. He gestures with his hand to emphasize the "ends with" concept.
2:00 – 5:00 02:00-05:00
The instructor focuses on the specific suffix "bab". He draws a transition from the start state $q_0$ to a new state $q_1$ labeled with the input 'b'. From $q_1$, he draws an arrow to state $q_2$ labeled 'a'. Finally, from $q_2$, he draws an arrow to a final state $q_3$ (indicated by a double circle) labeled 'b'. He explains that this linear sequence of states $q_0 o q_1 o q_2 o q_3$ is responsible for recognizing the suffix. He notes that if the machine reaches $q_3$, the string is accepted. He emphasizes that this path must be the *end* of the string. He writes "bab" above the transitions to reinforce the connection. He points to each state as he draws it.
5:00 – 7:29 05:00-07:29
To complete the NFA, the instructor addresses the requirement that the string can have *any* characters before the suffix. He draws a self-loop on the start state $q_0$ and labels it with "a, b". He explains that this loop allows the machine to consume any prefix. He writes a longer example string "a b a b a b a b" on the board to demonstrate how the machine can stay in $q_0$ for a long time. He highlights the non-deterministic aspect: at any point while reading 'b', the machine can choose to follow the self-loop or transition to $q_1$ to start matching the suffix. He concludes by pointing to the final diagram, showing the complete NFA with the self-loop on $q_0$ and the path for "bab". He explains that this is a standard technique for suffix problems.
The lecture provides a clear, step-by-step guide to constructing an NFA for a language defined by a suffix. The instructor effectively uses the whiteboard to visualize the state transitions. The key pedagogical point is the separation of concerns: using a self-loop on the start state to handle the "any prefix" condition and a linear chain of states to handle the specific "suffix" condition. This approach leverages the power of non-determinism, allowing the machine to "guess" when the suffix begins, which is a fundamental concept in automata theory. The final diagram is a standard solution for this type of problem, demonstrating how to handle arbitrary prefixes efficiently.

