Conversion form mealy machine to moore
Duration: 6 min
This video lesson is available to enrolled students.
Inside: a video lesson and guided study material.
Module outline
- Engineering Mathematics: Permutation and Combination, Linear Algebra, Calculus, Probability, Statistics, Signal Space and Optimum Detection, Probability, Statistics, Combinatorics
- 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
- Computer Architecture: Floating Point Rep, Cache Memory Organization, Input Output Organisation, Pipelining, Instr Formats & Modes, Control Unit Design
- C Language: C Fundamentals, Control Flow, Functions, Arrays & Pointers, Storage Classes, Structures & Enums, DMA, Macros, Scoping & File Handling
- Data Structures: Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing
- Algorithms: Algorithm Analysis, Time Complexity Analysis, Sorting Algorithms, Greedy Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos
- Theory Of Computation/Automata Theory: 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, Run Time Environment
- Operating System: Introduction to OS, Process Management, CPU Scheduling, Process Synchronization, Threads & Process Creation, Deadlock, Memory Management, Virtual Memory, Disc Scheduling, File Management
- DataBase Management System/DBMS: 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
- Computer Networks: Introduction to CN, DLL: Access Control, DLL: Flow Control, DLL: Error Control, 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
- General Aptitude: Ratio and Proportion (Ratios), Data Interpretation, Logarithm, Number System, HCF LCM, Sequence and Series (Series), Speed Time and Distance, Series (Number and Letter Series) (Numerical Relations and Reasoning), Coding Decoding, Data Sufficiency, Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning), Percentage, Mensuration and Geometry, Mental Ability, Arithmetic, Profit and Loss, Powers and Exponents (Surds and Indices), Average, Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning), Syllogisms, Venn Diagram, Seating Arrangements, Blood Relations, Directions (Direction Test), Analogy, Algebra, Analytical Reasoning (Counting Figures Reasoning), Puzzle Solving (Puzzles), Cubes & Dices, Ranking, Order and Sequence, Mixture and Alligation, Age Problems, Clock, Selection Decision Table (Decision Making), Data Arrangement, Ratio and Proportion, Vocabulary, Averages, Mixtures and Alligation, Percentages, Subject-Verb Agreement, Sentence Completion, Geometry, Reading Comprehension, Statistics, Three-Dimensional Patterns and Visualization, Permutations and Combinations, Trigonometry, Simplification and Approximation, Constraint Puzzles, Numerical Reasoning, Series Completion, Analogy and Classification, Patterns in Two-Dimensional Figures, Coding and Decoding, Mathematical Operations, Direction Sense, Assembling and Grouping of Shapes, Cubes and Dice, Profit, Loss and Discount, Mensuration, Probability, Measurement and Quantity Take-Off, Sentence Structure and Correction, Critical Reasoning, Syllogisms and Venn Diagrams, Order, Ranking and Sequence, Logical Deduction and Induction, Narrative Sequencing, Project Monitoring, Resources and Safety, Traverse Surveying, Clocks and Calendars, Time and Work, Algebra, Data Interpretation, Speed, Time and Distance, Data Sufficiency, Blood Relations, Simple Interest and Compound Interest, Calendar, Alphabet and Word Tests, Sequences and Series, Powers, Surds and Logarithms, Number System, Transformation of Shapes
- English (Verbal Aptitude): Vocabulary, Noun, Subject Verb Agreement (Verb Noun Agreement), Adjectives, Tenses, Pronoun, Preposition, Direct and Indirect Speech, Sentence Re-arrangements (Para Jumbles) (Narrative Sequencing), Comprehension / Reading Comprehension / Unseen Passages (Critical Reasoning) (Paragraph Questions), Sentence Correction (Error Correction), Verbal Analogy (Word Based Analogy), Conjunction, Verb, Articles, Adverb, Modals, Prepositions and Conjunctions, Idioms and Phrases, Verb Forms and Verb Patterns, Sentence Basics, Nouns and Pronouns, Articles and Determiners, Adjectives and Adverbs, Modals, Conditionals and Subjunctive, Voice and Reported Speech, Blood Relations, Tenses, Vocabulary
- Live Classes Recordings(Earlier Batch): GATE 2026 Live Class
- Full Mock Test:
- Previous Year Papers:
- GATE 2026 Counselling: Counselling and Guidance Sessions
AI summary & chapters
AI Summary
An AI-generated summary of this video lecture.
The video lecture details the procedure for transforming a Mealy machine into a Moore machine. The instructor begins by presenting a specific Mealy machine example, complete with a state diagram and a state transition table. The diagram features four states: q1, q2, q3, and q4, with transitions labeled by input/output pairs (e.g., a/1, b/0). The instructor explains that in a Mealy machine, outputs are associated with transitions, whereas in a Moore machine, outputs are associated with states. This fundamental difference necessitates a transformation process. The core strategy involves splitting states that have different outputs associated with their incoming transitions. He analyzes the incoming transitions for each state. For instance, state q2 is entered from q1 with output 0 and from q3 with output 1. Because the incoming outputs differ, q2 must be split into two new states: q2_0 (representing entry with output 0) and q2_1 (representing entry with output 1). Similarly, state q3 is split into q3_0 and q3_1. States q1 and q4 do not require splitting as their incoming transitions have uniform outputs. The instructor then begins constructing a new state table for the resulting Moore machine. He lists the new states in the first column: q1, q2_0, q2_1, q3_0, q3_1, and q4. He assigns the output value (lambda) to each new state based on the output of the transition that leads into it. For example, q2_0 is assigned output 0, and q2_1 is assigned output 1.
Chapters
0:00 – 2:00 00:00-02:00
The instructor introduces the topic "Procedure for Transforming a Mealy Machine into a Moore Machine." He presents the initial Mealy machine diagram and table. He explains the concept of splitting states. He writes the new state names on the board: q1, q2_0, q2_1, q3_0, q3_1, q4. He explains that q2 and q3 need splitting because they have different incoming outputs. He writes "q1" and assigns it output 1. He writes "q2_0" and "q2_1". He writes "q3_0" and "q3_1". He writes "q4". He explains that the output of the new Moore state corresponds to the output of the transition entering it. He uses red ink to write the new states and outputs on the whiteboard.
2:00 – 5:00 02:00-05:00
The instructor fills out the Moore machine state table. He assigns the output column (lambda) for each new state. He then determines the next states for inputs 'a' and 'b'. He traces the original Mealy transitions. For q1, input 'a' goes to q1 (output 1), so next state is q1. Input 'b' goes to q2 (output 0), so next state is q2_0. He repeats this for all new states, mapping transitions like q2 -> q4 (output 1) to q2_0 -> q4 and q2_1 -> q4. He writes the transitions in the table. He writes "q1" under 'a' for q1. He writes "q2_0" under 'b' for q1. He writes "q4" under 'a' and 'b' for q2_0. He writes "q4" under 'a' and 'b' for q2_1. He writes "q2_0" under 'a' and "q3_0" under 'b' for q3_0. He writes "q2_1" under 'a' and "q3_1" under 'b' for q3_1.
5:00 – 5:34 05:00-05:34
The instructor completes the table for state q4. He writes the next states for q4: input 'a' goes to q3 (output 0), so next state is q3_0. Input 'b' goes to q1 (output 1), so next state is q1. He finalizes the table, showing the complete Moore machine with 6 states. He briefly mentions "m <= n" and "m x n" which likely refers to the relationship between the number of states in the original and new machines. He ensures all transitions are correctly mapped.
The video provides a clear, step-by-step guide to converting a Mealy machine to a Moore machine by splitting states based on incoming transition outputs. The instructor demonstrates this by constructing a new state table, effectively mapping the edge-based outputs of the Mealy machine to node-based outputs in the Moore machine. The process ensures that the output is now a function of the current state alone, satisfying the definition of a Moore machine.

