DFA Designing string contains sub string s

Duration: 6 min

This video lesson is available to enrolled students.

Return to /learn/ZERO-TO-HERO/theory-of-computation/deterministic-fa-dfa/dfa-construction-design/asset-dfa-designing-string-contains-sub-string-s after enrolling

Inside: a video lesson and guided study material.

Module outline

  1. 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
  2. Discrete Mathematics: Set Theory, Relations, Functions, Graph Theory, Group Theory, Propositional and Predicate Logic
  3. 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
  4. 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
  5. Operating System: Introduction to OS, Process Management, CPU Scheduling, Process Synchronization, Deadlock, Virtual Memory, Disc Scheduling, File Management, Memory Management, Threads & Process Creation
  6. 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
  7. Data Structures: Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing
  8. Algorithms: Algorithm Analysis, Sorting Algorithms, Greedy Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos, Time Complexity Analysis
  9. 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
  10. 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
  11. C language: C Fundamentals, Control Flow, Functions, Arrays & Pointers, Storage Classes, Structures & Enums
  12. Software Engineering: Fundamentals of Software Engineering, Software Requirements and Quality Assurance, Software Design, Estimation and Metrics, Software Testing, Software Maintenance and Configuration Management
  13. Emerging Trends & AI: Emerging Tech Trends, Artificial Intelligence, Cloud Computing, Internet of Things
  14. Computer Graphics: Basics of Computer Graphics, 2-D Geometrical Transforms and Viewing
  15. 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
  16. 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
  17. 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
  18. Engineering Mathematics: Calculus, Vectors
  19. GATE Live Class Recordings 2026: GATE 2026 Live Class
AI summary & chapters

AI Summary

An AI-generated summary of this video lecture.

This educational video lecture demonstrates how to design a minimal Deterministic Finite Automaton (DFA) that accepts all strings over the alphabet {a, b} containing a specific substring. The instructor, Sanchit Jain, begins by defining the problem and listing two examples: substring 'abb' and substring 'aba'. He systematically constructs the DFA for 'abb', starting with an initial state and adding transitions for each character of the substring. He carefully handles edge cases and overlaps, such as input 'a' at state q2 (having seen 'ab'), redirecting it to state q1. He then briefly sketches the DFA for 'aba', showing similar state transitions. Finally, he concludes with a general rule for constructing such DFAs, stating that a substring of length m requires m+1 states and does not necessitate a dead state.

Chapters

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

    The video opens with the problem statement on the whiteboard: 'Design a minimal DFA that accepts all strings over the alphabet {a, b}, where every accepted string 'w' contains sub string s.' The instructor lists two examples: i) abb and ii) aba. He begins constructing the DFA for the first example, 'abb'. He draws four states labeled q0, q1, q2, and q3. He draws a transition from q0 to q1 on input 'a', from q1 to q2 on input 'b', and from q2 to q3 (the final state) on input 'b'. He adds a self-loop on q0 for input 'b' and a self-loop on q1 for input 'a'. He then addresses the case where the input is 'a' while in state q2 (having seen 'ab'), drawing a transition from q2 back to q1 to handle the overlap in strings like 'aba'.

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

    The instructor continues refining the DFA for 'abb', adding self-loops on the final state q3 for both 'a' and 'b' to indicate that once the substring is found, any subsequent characters are accepted. He writes example strings like 'abbab' and 'abba' to verify the logic. He then moves to the second example, 'aba'. He draws a new set of states q0, q1, q2, q3. He draws transitions: q0 to q1 on 'a', q1 to q2 on 'b', and q2 to q3 on 'a'. He adds a self-loop on q0 for 'b' and a self-loop on q1 for 'a'. He draws a transition from q2 to q0 on input 'b'. He adds self-loops on the final state q3 for 'a' and 'b', emphasizing that the machine remains in the accepting state once the substring is detected.

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

    The instructor presents a 'Conclusion' slide summarizing the general method. He writes the formula: 'if w = xsx, |s| = m, then no of states in the DFA is m+1'. He underlines that there is 'No need of dead state' because all transitions can be managed within the existing states. He also notes that one 'Can loop on final state'. He explains that for any substring of length m, the minimal DFA will require exactly m+1 states, covering the start state through the final accepting state, without needing a separate trap or dead state for invalid inputs.

The lecture progresses from a specific problem definition to the practical construction of DFAs for substrings 'abb' and 'aba'. The instructor demonstrates the step-by-step addition of states and transitions, highlighting the critical logic of handling overlaps where a prefix of the substring matches a suffix of the current input. The lesson culminates in a generalized rule for such problems, establishing that a substring of length m necessitates m+1 states and that a dead state is unnecessary, as the automaton can always transition to a relevant previous state.

Loading lesson…