DFA Designing where string contain b as 2nd symbol from left

Duration: 4 min

This video lesson is available to enrolled students.

Return to /learn/COAL-INDIA-MANAGEMENT-TRAINEE/theory-of-computation/deterministic-fa-dfa/dfa-construction-design/asset-dfa-designing-where-string-contain-b-as-2nd-symbol-from-left 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.

This educational video provides a step-by-step guide to designing minimal Deterministic Finite Automata (DFA) for languages defined by specific positional constraints on string characters. The instructor begins by solving a problem where the second character from the left must be 'b'. He then generalizes this approach to a more complex problem where the fourth character must be 'a', deriving a general formula for the number of states required based on the position n.

Chapters

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

    The instructor presents the first problem on the whiteboard: 'Design a minimal DFA that accepts all strings over the alphabet Σ = {a, b} such that for every accepted string 2nd from left end is always b.' He writes down accepted examples like 'ababab' and 'ba', underlining the second 'b' to highlight the condition. He also writes rejected examples like 'a', 'b', and 'bab', marking them with crosses. He then draws the DFA structure. He starts with state q0 (initial). A transition labeled 'a, b' leads to state q1, representing the consumption of the first character. From q1, a transition labeled 'b' leads to state q2 (final state), satisfying the condition. If the input is 'a' at this stage, it goes to a dead state q3. State q2 has self-loops for 'a' and 'b', indicating that once the condition is met, any subsequent characters are accepted. State q3 also has self-loops for 'a' and 'b'.

  2. 2:00 – 3:30 02:00-03:30

    The problem shifts to: 'Design a minimal DFA that accepts all strings over the alphabet Σ = {a, b} such that for every accepted string 4th from left end is always a.' The instructor draws a linear chain of states to count the characters: q0 -> q1 -> q2 -> q3. From q3, a transition labeled 'a' leads to the final state q4. If the input is 'b' at q3, it transitions to a dead state q5. State q4 has self-loops for 'a' and 'b'. Finally, he writes a conclusion on the board: 'No of states will be n+2, if position is n'. He verifies this with calculations: for the 2nd position, 2+2=4 states; for the 4th position, 4+2=6 states.

The lesson effectively bridges specific examples to a general rule for DFA construction. By analyzing the 2nd and 4th position constraints, the instructor illustrates that a linear chain of states is needed to track position, followed by a final accepting state and a single dead state for invalid transitions. This results in a predictable state count of n+2 for the n-th position constraint.

Loading lesson…