Finite State Machine | Computer Science

Finite State Machine | Computer Science

• 1.
  Finite string matchingconsists of states, inputs and outputs.
• 2.
  In a FiniteState Machine diagram: 1. States are represented by circle. 2. Transitions are represented by an arrow and are labeled with an input causing the transition. 3. An accepted state is represented by a double circle. TRANSITION 1 TRANSITION 2 TRANSITION 3 TRANSITION 4
• 3.
  Finite State MachineDiagram:
• 4.
  In the abovediagram it starts in state S1, an input of A will keep it in state S1 and an input of B will move it to state S2. Once it is in S2 an input of A will keep it there, and an input of B will switch it back to S1. This means that the following inputs are valid: AABBAABBA BBAAABBAA
• 5.
  Example of FiniteState Machine Turnstile is an example of a mechanism modeled on finite state machine used to control the access at the entrance gate of an amusement park or museum with three arms that rotates at waist height.
• 6.
  Finite State Machinestate transition table representing state of Turnstile Current State Input Next State Output Locked Token Unlocked Turnstile unlocked for entry Push Locked None Unlocked Token Unlocked None Push Locked After one entry Turnstile locked again.
• 7.
  Hey Friends, This wasjust a summary on Finite State Machine. For more detailed information on this topic, please type the link given below or copy it from the description of this PPT and open it in a new browser window. http://www.transtutors.com/homework-help/computer-science/finite-state- machines.aspx