DFA Designing where string contain b as 2nd symbol fromRight
Duration: 10 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.
This educational video provides a step-by-step guide to designing a minimal Deterministic Finite Automaton (DFA) for a specific formal language. The core problem involves accepting all strings over the alphabet $\Sigma = \{a, b\}$ where the second symbol from the right end is always 'b'. The instructor begins by clarifying the language definition through a series of concrete examples, distinguishing between valid and invalid strings. He then proceeds to construct the DFA state by state, carefully defining transitions for both 'a' and 'b' inputs to track the position of symbols relative to the end of the string. After constructing the initial automaton, he performs a minimization check to ensure no redundant states exist. Finally, the lecture generalizes this concept, deriving a formula for the number of states required to check the $n$-th symbol from the right, concluding with a multiple-choice question to test comprehension.
Chapters
0:00 – 2:00 00:00-02:00
The lecture commences with the problem statement displayed on the screen: 'Design a minimal DFA that accepts all strings over the alphabet $\Sigma = \{a, b\}$ such that for every accepted string 2nd from right end is always b.' The instructor writes down a list of candidate strings to test the condition: $L = \{ \epsilon, b, ab, ba, aaa, aba, bbb, bbab \}$. He methodically evaluates each string. He crosses out $\epsilon$ and $b$ because they are too short to have a second symbol from the right. He crosses out $ab$ and $aaa$ because their second-to-last characters are 'a'. He places checkmarks next to $ba, aba,$ and $bbb$, confirming they satisfy the condition. He also crosses out $bbab$ because the second-to-last character is 'a'. This process establishes the precise criteria for the language.
2:00 – 5:00 02:00-05:00
The instructor constructs the DFA diagram. He starts with state $q_0$ (start state) having a self-loop on 'a' and a transition to $q_1$ on 'b'. From $q_1$, 'a' leads to a final state $q_2$, and 'b' leads to another final state $q_3$. He defines transitions for $q_2$ and $q_3$ to handle subsequent inputs, ensuring the '2nd from right' logic is maintained. Specifically, from $q_2$, an 'a' input resets the tracking to $q_1$, while a 'b' input keeps the system in a valid final state $q_3$. From $q_3$, an 'a' input moves to $q_2$, and a 'b' input loops back to $q_3$. To verify minimality, he draws a transition table listing states $q_0, q_1, q_2, q_3$ and their transitions for 'a' and 'b'. He analyzes the table to check if any states are equivalent. He notes that $q_2$ and $q_3$ are both final states, but their transitions differ: $q_2$ on 'a' goes to $q_1$ (non-final), while $q_3$ on 'a' goes to $q_2$ (final). This difference proves they are distinguishable. Similarly, $q_0$ and $q_1$ are distinguished because $q_0$ on 'a' stays in $q_0$ (non-final), while $q_1$ on 'a' goes to $q_2$ (final). Thus, all four states are distinct and necessary for the minimal DFA.
5:00 – 10:00 05:00-10:00
The instructor moves to a generalization of the problem. He writes a conclusion on the board: 'No of states will be $2^n$, if position is n.' He explains that if the requirement changes to the $n$-th symbol from the right being 'b', the number of states required doubles for each increment in $n$. He illustrates this by sketching a larger state table for $n=3$ (3rd symbol from right), labeling states $q_0$ through $q_7$. He circles the final states in this larger table to show the pattern of acceptance. This section connects the specific 4-state solution to a broader theoretical concept in automata theory regarding suffix recognition, emphasizing that the complexity grows exponentially with the position $n$.
10:00 – 10:12 10:00-10:12
The video concludes with a multiple-choice question displayed on the screen: 'The no of final states in a minimal DFA, that accept all string over a... such that 2nd symbol from right end is always b.' The options provided are a) 1, b) 2, c) 4, d) none. This question directly tests the student's ability to identify the accepting states in the DFA constructed earlier, where states $q_2$ and $q_3$ were identified as the final states.
The video effectively bridges the gap between abstract language definitions and concrete automata construction. It starts with the fundamental task of validating strings against a positional constraint, moves to the mechanical construction of the state machine, and culminates in a theoretical generalization. The progression from specific examples to a general formula ($2^n$) provides a comprehensive understanding of how DFAs handle suffix-based conditions. The instructor emphasizes that the number of states grows exponentially with the position $n$, a key takeaway for students studying formal languages.

