How Many Different DFA's Can Be Designed Part-2
Duration: 5 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, presented by Sanchit Jain from Knowledge Gate, addresses a fundamental problem in automata theory: calculating the total number of possible Deterministic Finite Automata (DFAs) that can be designed under specific constraints. The instructor starts by presenting a problem statement on the screen: "Q how many DFA can be designed, with a fixed initial state, over an alphabet $\Sigma = \{a, b\}$, and the number of states be two." However, he immediately modifies the problem, crossing out "two" and writing a superscript "3", indicating that the example will use three states ($n=3$) for clarity. He begins the derivation by drawing a transition table. The rows represent the states ($q_0, q_1, q_2$) and the columns represent the input symbols ($a, b$). He explains that for every state and every input symbol, there must be a defined transition to a next state. Since there are 3 states available, each cell in the transition table has 3 possible choices. With 3 states and 2 input symbols, there are a total of $3 imes 2 = 6$ transitions. Therefore, the total number of possible transition functions is $3^6$. Next, the instructor considers the final states. He explains that for a set of 3 states, any subset of these states can be designated as final states. The number of subsets of a set with 3 elements is $2^3$, which equals 8. He writes $8 imes 3^6$ on the board, representing the total number of DFAs for this specific case. This combines the choices for transitions and the choices for final states. The problem specifies a "fixed initial state," which simplifies the calculation by removing the need to choose an initial state from the $n$ available states. In the second half of the video, the instructor generalizes this specific example to derive a universal formula. He introduces variables $n$ for the number of states ($|Q| = n$) and $m$ for the size of the input alphabet ($|\Sigma| = m$). He reiterates that the number of transitions is $n imes m$, and since each transition can go to any of the $n$ states, the number of transition functions is $n^{n imes m}$. Similarly, the number of ways to choose final states remains $2^n$ because each of the $n$ states has 2 possibilities (final or non-final). The video concludes with a slide summarizing the result: "If no of states is $|Q| = n$, and no of input alphabet $|\Sigma| = m$, Then no of states will be $n^{n imes m} * 2^n$". This formula provides a direct method to calculate the number of possible DFAs for any given number of states and alphabet size, assuming a fixed initial state. The instructor emphasizes that this formula is a standard result used in competitive exams and theoretical computer science to count the complexity of DFA design. The slide also contains a typo where it says "no of states will be" instead of "no of DFAs will be", but the mathematical expression is correct.
Chapters
0:00 – 2:00 00:00-02:00
The instructor introduces the problem statement on the screen: "Q how many DFA can be designed, with a fixed initial state, over an alphabet $\Sigma = \{a, b\}$, and the number of states be two." He immediately corrects the number of states from "two" to "3" by writing a superscript. He then draws three columns of circles labeled 0, 1, and 2 to represent the states. He proceeds to draw a transition table with rows labeled $q_0, q_1, q_2$ and columns labeled $a, b$. He explains that for each of the 6 cells in the table (representing transitions), there are 3 possible next states. He writes the number 3 in each cell to illustrate this. He calculates the total number of transition functions as $3^6$. He then explains that for 3 states, there are $2^3 = 8$ ways to choose the final states. He writes the final calculation $8 imes 3^6$ on the board to represent the total number of DFAs for this specific case.
2:00 – 4:40 02:00-04:40
The instructor generalizes the specific example to derive a universal formula. He introduces variables $n$ for the number of states ($|Q| = n$) and $m$ for the size of the input alphabet ($|\Sigma| = m$). He explains that the number of transitions is $n imes m$, and since each transition can go to any of the $n$ states, the number of transition functions is $n^{n imes m}$. Similarly, the number of ways to choose final states remains $2^n$ because each of the $n$ states has 2 possibilities (final or non-final). He writes the final formula $n^{n imes m} * 2^n$ on the board. The video concludes with a slide summarizing the result with the text: "If no of states is $|Q| = n$, and no of input alphabet $|\Sigma| = m$, Then no of states will be $n^{n imes m} * 2^n$". The instructor notes that this formula is a standard result used in competitive exams and theoretical computer science to count the complexity of DFA design. The slide also contains a typo where it says "no of states will be" instead of "no of DFAs will be", but the mathematical expression is correct.
The video provides a step-by-step derivation of the formula for the number of possible DFAs. It starts with a concrete example using 3 states and an alphabet of size 2, calculating the number of transition functions ($3^6$) and final state combinations ($2^3$). It then generalizes this to $n$ states and an alphabet of size $m$, resulting in the formula $n^{n imes m} * 2^n$. The lecture emphasizes the combinatorial logic behind choosing transitions and final states, assuming a fixed initial state.

