Chapter 18 - Finite State Machines

Question 1

Define Finite State Machine (FSM)

Answer 1

Any device that stores its current status and whose status can change as the result of an input. Mainly used as conceptual model for designing and describing systems.

Question 2

What is a State transition diagram?

Answer 2

A visual representation of an FSM using circles and arrows.

Question 3

Define Accepting State.

Answer 3

The state that identifies whether an input has been accepted.

Question 4

What is a state transition table?

Answer 4

A tabular representation of an FSM showing inputs, current state and next state.

Question 5

What is a mealy machine?

Answer 5

A type of finite state machine wth outputs.

Question 6

Key Points:

Answer 6

1. A FSM is a concept that shows a device that stores the current state and how the state will change asa result of an input.
2. They can be used for checking the syntax of language including programming languages.