Theory of Computation - Finite State Machines Quiz

What is a characteristic of a finite state machine (FSM)?

• It can be in multiple states at the same time.

• It can change states without any conditions.

• It is defined by a list of states and conditions for transitions.

• It always has outputs linked to its states.

What is the term used to describe the change from one state to another in a finite state machine?

• Transition

• Transformation

• Translation

• Transposition

What happens if you insert another ticket when the turnstile is in the unlocked state?

• The turnstile locks.

• The turnstile remains unlocked.

• The turnstile issues a refund.

• The turnstile changes to a maintenance mode.

Which action transitions the state from "Locked" to "Unlocked"?

• Insert ticket

• Push

• Valid ticket

• Invalid ticket

Finite state machines help in the definition of languages by deciding what?

• The colour of a language

• The speed of a language

• Whether a particular word is allowed in a language

• The taste of a language

What do the symbols processed by a finite state automaton usually represent?

• Numbers

• Events

• Colours

• Shapes

What does a simple circle represent in finite state machine notation?

• State

• Start state

• End state or accept state

• Transition

What does the language recognised by a finite state machine consist of?

• All possible strings

• All strings rejected by it

• All strings accepted by it

• All strings modified by it

Which component in a finite state machine determines the next state based on the current state and input?

• Input alphabet

• Output function

• Start state

• Transition function

What is the initial state of a finite state machine called?

• Start state

• Final state

• Transition state

• Accept state