Finite State Machines

Question 1

What is Automata Theory?

Answer 1

• Using logic and comp to solve comp prob
• Used to understand how machines compute functions and solve problems

Question 2

What is automation?

Answer 2

• Abstract models of machines that perform computations
• On an input by moving through a series of states or configurations

Question 3

What is an automated machine?

Answer 3

• Finite State Machine
• State Transition Diagrams
• Turing Machines

Question 4

What are the features of an automated machine?

Answer 4

• Inputs
  
  • Assumed to be sequences of symbols selected from a finite set of input signals
  • Set I is the set {x1,x2,x3 … xk}
    
    • k = number of input
• Outputs
  
  • Sequences of symbols form a finite set Z
  • Z is the set {y1,y2,y3 … ym}
    
    • m = number of outputs
• States
  
  • Finite set Q
  • Definition depends on type of automation

Question 5

What are FSM?

Answer 5

• Abstract models of computation (Automated Machine)
• Finite Number of States - not alot of computational power
• Can only be in one state at a time where changes are based on input
• Defines the simple behaviour of simple machines

Question 6

What is the tuple of a finite state machine?

Answer 6

Question 7

Give and example of a deterministic FSM

Answer 7