Finite State Machine : Type 3 : Problem

TL;DR

Design a FSM to output remainders when a decimal number is divided by 3, expanding on previous type 1 and 2 problems.

Transcript

hello friends welcome back so now we are going to start the last type of problem of finite state machine that is type 3 problems let's get started so the question which is given to us in type 3 problems says design a FSM to output the remainder when a decimal number is divided by 3 you all are familiar with this problem because the first type of pr... Read More

Key Insights

• 🔢 Type 3 finite state machine problems focus on outputting remainders when a decimal number is divided by 3, providing a new perspective to the input processing.
• 🅰️ These problems are considered simpler due to their reliance on previous type 1 and type 2 problem concepts, with similarities in transition tables and machine functions.
• 🤩 The key difference in type 3 problems lies in the output focus on remainders rather than just validating input divisibility by 3.
• 🖐️ State functions and machine functions play crucial roles in determining the output or remainder in type 3 problems.

Questions & Answers

Q: What is the main objective of solving type 3 problems in finite state machines?

The main goal is to design a machine that outputs the remainder when a decimal number is divided by 3, expanding beyond traditional yes or no outputs.

Q: How are type 3 problems related to type 1 and type 2 problems in finite state machines?

Type 3 problems build upon type 1 and type 2 problems, utilizing similar transition tables and machine functions but focusing on outputting remainders instead of validity.

Q: Why are type 3 problems considered simple compared to type 1 and type 2 problems?

Type 3 problems are simpler because they leverage the groundwork laid by type 1 and type 2 problems, with the main difference being the output focus on remainders.

Q: How do you determine the output or remainder in a type 3 finite state machine problem?

The output or remainder is determined by the machine function, which maps each state and input to the corresponding remainder output based on the division by 3.

Summary & Key Takeaways

• Type 3 problems in finite state machines involve designing a machine to output remainders when a decimal number is divided by 3.

• These problems build upon type 1 and type 2 problems, providing a new output perspective beyond just yes or no.

• The transition table and machine function for type 3 problems are similar to type 1 problems, with the focus on remainders as outputs.