--%>
Assignment Help - homework help

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 : Reducing state space of code What is

    What is the way to reduce the state space of the code during model checking?

    		•
  • Q : State Space Reduction in Java PathFinder

    State Space Reduction: JPF is a so-called explicit-state model checker, as it enumerates all visited states, and therefore suffers from the state explosion problem inherent in analyzing large programs. It also contains garbage collection, because a ty

    		•
  • Q : What is an Infinite recursion Infinite

    Infinite recursion: Recursion which does not finish. This can effect from any of direct recursion, indirect recursion or the mutual recursion. It is generally the outcome of a logical error, and can consequence in stack overflow.

    		•
  • Q : Describe the term Context Switch

    Describe the term Context Switch.

    		•
  • Q : State the term multi programming State

    State the term multi programming.

    		•
  • Q : Commands used to create the files

    Specify different commands which are used in order to create the files?

    		•
  • Q : What is Low level programming languages

    Low level programming languages: It is frequently termed as `assembly languages’; these give little more than the fundamental instruction set of a particular Central Processing Unit. Therefore programs written in low level programming languages

    		•
  • Q : Explain Mutator method Mutator method :

    Mutator method: It is a method specifically designed to permit controlled modification of a private attribute of a class. By convention, we name the mutators with a set prefix obeyed by the name of the attribute being transformed. For example, the mut

    		•
  • Q : Define Java virtual machine or JVM

    Define Java virtual machine (JVM): A Java Virtual Machine (JVM) is an abstract computing machine, or virtual machine (set of computer software programs and data structures) which is a platform-independent execution environment that converts Java bytec

    		•
  • Q : Describe Last in-first out Last in,

    Last in, first out: It is the LIFO semantics of a stack data structure. Items are eliminated in the opposite order to which it arrived in the stack; therefore newer items are always eliminated before older ones.

    		•