Question

Our goal is to design a traffic-light controller with the following properties; it lights up the green light (output G) for 15 seconds, followed by the yellow light (output Y) for 9 seconds, then the red light (output R) for 12 seconds. The controller will repeat this pattern forever. Our system will have a clock signal with a period of 3 seconds. 1. How many states, N, are needed in a FSM to implement this controller

Answer 1

Answer:

There will be three (3) states that will be needed in-order to implement the FSM controller.

Explanation:

FSM stands for  Finite-State Machine. This is an example of a model used in  mathematical computation. The FSM is an abstract machine that can be in exactly one of a finite number of states at any given time.