--%>

State machine to identify three consecutive heads

Explain a finite state machine which will detect three consecutive coins tosses of one coin which results in heads?

E

Expert

Verified

State machine to identify three consecutive heads appearing within multiple tosses;

State 1: initial state
So long as the toss results within TAIL, in this state when the toss results in HEAD go to state 2.

State 2: HEAD1 resulted within the next toss; when TAIL is resulted go to the initial state1.
When HEAD is resulted go to state3.

state3: HEAD2 is resulted in the next toss; when TAIL is resulted go to the initial state1.
When HEAD is resulted go to state4.

state4: HEAD3 is resulted and it is the last state
So long as the HEAD results in each next toss be in state 4. When any toss results in TAIL go to initial state1.

   Related Questions in Programming Languages

  • Q : State HyperText Transfer Protocol

    HyperText Transfer Protocol: The HyperText Transfer Protocol (abbreviated as HTTP) is a set of rules stated to enable a Web client (that is, browser) to interact with the Web server.

  • Q : What do you mean by Class variable What

    What do you mean by Class variable: It is a synonym for the static variable.

  • Q : Define the term Condition Define the

    Define the term Condition: It is a Boolean expression which controls a conditional statement or loop.

  • Q : Program to controls a quiz show in C++

    Foundations of Computer Science In this project, we will write a program that controls a quiz show, much like the many popular TV shows. The program will read in a group of questions and thei

  • Q : Describe Software reuse Software reuse

    Software reuse: It is the ability to reuse software components in various contexts. The object-oriented languages aid to encourage reuse by their support of encapsulation.

  • Q : Define Peer Peer : It is a term

    Peer: It is a term employed of the Abstract Windowing Toolkit (AWT) to refer to the underlying classes which give the platform-specific implementation of the component classes.

  • Q : Rings present in CPU What do you mean

    What do you mean by rings present in CPU?

  • Q : Define Livelock Livelock : It is a

    Livelock: It is a situation in which a thread waits to be notified of a condition however, on waking, finds that the other thread has inverted the condition another time. The primary thread is forced to wait again. Whenever this occurs for an indefini

  • Q : What is validating parser What is

    What is validating parser? Answer: A parser makes sure that an XML document is valid additionally to being well formed.

  • Q : Define the term Catching exceptions

    Catching exceptions: Exceptions are caught in the catch clause of the try statement. Catching an exception provides the program a chance to recover from the trouble or attempt a repair for whatsoever caused it.