Question: design a finite state machine with the following problem statement a Moore type using D flip-flops please explain procedure moore typoes 2C. Carwash Simulater Overvicw

design a finite state machine with the following problem statement

design a finite state machine with the following problem statement a Moore

a Moore type using "D flip-flops" please explain procedure

moore typoes 2C. Carwash Simulater Overvicw This project is to design a state machine simulating the control of an automatic car wash. Depending on inputs from the user, the simulator will cycle through states representing inactive, nnse #1. soap spray, scrub, rinse #2, wax, rinse #3. dry. There will be three inputs. One "start) will activate the car wash, one ("deluxe") will choose between a normal cycle (skip the last threesteps.orwax.rinse #3, dry) and a deluxe cycle, and one ("kill.) will stop everything and go back to the inactive state in case of emergencies Inputs I. START. 2. DELUXE . KILL OoO Outputs Eight LEDs, one representing each of the states: I. Inactive 2. Rinse #1 3. Soap spray 4. Scrub 5, Rinse #2. - 6. Wax 7. Rinse #3 8. Dry The system should remain in the inactive state unless the START input goes high. If the START is high, the system should start progressing through the steps of the car wash. If the DELUXE switch is low, the LEDs should be activated in the following order: (rinse #1. soap spray, scrub, rinse #2, back 10 inactive. The cycle should continue all the way back to inactive even if the START input goes low If the DELUXE switch is high, the LEDs should be activated in the following order: rinse #1. soap spray, scrub, nnse #2, wax, rinse #3, dry, back to inactive. The cycle should continue all the way back to inactive even if the START input goes low The decision on whether to do a normal or deluxe cycle can be made in the Rinse #2 state, depending on the state of the DELUXE switch. If at any time the KILL input goes high, the next state must be Inactive, regardless of any of the other inputs. p-flir-lus urstens 3. STATE TRASitionABE S. Circuit shemati moore typoes 2C. Carwash Simulater Overvicw This project is to design a state machine simulating the control of an automatic car wash. Depending on inputs from the user, the simulator will cycle through states representing inactive, nnse #1. soap spray, scrub, rinse #2, wax, rinse #3. dry. There will be three inputs. One "start) will activate the car wash, one ("deluxe") will choose between a normal cycle (skip the last threesteps.orwax.rinse #3, dry) and a deluxe cycle, and one ("kill.) will stop everything and go back to the inactive state in case of emergencies Inputs I. START. 2. DELUXE . KILL OoO Outputs Eight LEDs, one representing each of the states: I. Inactive 2. Rinse #1 3. Soap spray 4. Scrub 5, Rinse #2. - 6. Wax 7. Rinse #3 8. Dry The system should remain in the inactive state unless the START input goes high. If the START is high, the system should start progressing through the steps of the car wash. If the DELUXE switch is low, the LEDs should be activated in the following order: (rinse #1. soap spray, scrub, rinse #2, back 10 inactive. The cycle should continue all the way back to inactive even if the START input goes low If the DELUXE switch is high, the LEDs should be activated in the following order: rinse #1. soap spray, scrub, nnse #2, wax, rinse #3, dry, back to inactive. The cycle should continue all the way back to inactive even if the START input goes low The decision on whether to do a normal or deluxe cycle can be made in the Rinse #2 state, depending on the state of the DELUXE switch. If at any time the KILL input goes high, the next state must be Inactive, regardless of any of the other inputs. p-flir-lus urstens 3. STATE TRASitionABE S. Circuit shemati

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Databases Questions!