Describe a finite state machine that will detect three
consecutive coin tosses (of one coin) that results in heads.
- 1 Answers
- 17182 Views
- Intel, I also Faced
- E-Mail Answers
Answer Posted / amar
State machine to detect 3 consecutive heads appearing in
multiple tosses;
state 1 : initial state
As long as the toss results in TAIL , in this state
If the toss results in HEAD go to state 2
state 2 : HEAD1 resulted
in the next toss , If TAIL is resulted go to
the initial state1 . If HEAD is resulted go to
state3.
state3 : HEAD2 is resulted
in the next toss , If TAIL is resulted go to
the initial state1 . If HEAD is resulted go to
state4.
state4 : HEAD3 is resulted and this is the final state
As long as the HEAD results in each next toss
be in state 4. If any toss results in TAIL go to
initial state1
| Is This Answer Correct ? | 76 Yes | 3 No |
Post New Answer View All Answers
How does a Bandgap Voltage reference work?
Explain Process technology? What package was used and how did you model the package/system? What parasitic effects were considered?
What are the ways to Optimize the Performance of a Difference Amplifier?
what is the difference between the TTL chips and CMOS chips?
Differences between Array and Booth Multipliers?
How about voltage source?
How to improve these parameters? (Cascode topology, use long channel transistors)
what is the use of defpararm?
Explain what is multiplexer?
Explain Cross section of an NMOS transistor?
How binary number can give a signal or convert into a digital signal?
Are you familiar with the term snooping?
what is multiplexer?
What are the steps required to solve setup and hold violations in vlsi?
Describe a finite state machine that will detect three consecutive coin tosses (of one coin) that results in heads.
