SLR7 | Finite State Machines

1. What is a Finite State Machine (FSM)?

• A machine that performs an infinite number of operations

• A mathematical model of computation with a limited number of states

• A model for data storage in computers

• A machine that can process any type of data

2. Which of the following is a key component of a Finite State Machine?

• A state transition diagram

• Infinite memory

• Random state changes

• A binary code generator

3. In a Finite State Machine, a state represents:

• A condition or situation that the system can be in at any given time

• A random variable in computation

• A specific mathematical operation

• A function that modifies input

4. How does an FSM transition from one state to another?

• Based on the input symbol and current state

• By random selection

• Automatically without any input

• By following a pre-determined schedule

5. What is the starting state in a Finite State Machine called?

• Final state

• Accepting state

• Initial state

• Transition state

Which of the following is NOT a type of Finite State Machine?

• Deterministic Finite Automaton (DFA)

• Non-deterministic Finite Automaton (NFA)

• Pushdown Automaton (PDA)

• Binary State Automaton

What is the purpose of an accepting state in an FSM?

• It is where the machine starts

• It signifies the end of an input string and determines acceptance

• It performs calculations

• It holds the memory of previous states

Which of the following best describes the language accepted by a Finite State Machine?

• A sequence of numbers only

• A collection of operations

• A set of strings that the FSM can process and accept

• Any random sequence of characters

In a Mealy Machine, when does the output change?

• The output changes only when the machine enters an accepting state

• The output changes based on the current state only

• The output changes whenever the input symbol is processed, based on the current state

• The output is always fixed and does not change

Which of the following statements about a Mealy Machine is true?

• A Mealy Machine does not have states

• The output of a Mealy Machine is independent of the input

• In a Mealy Machine, the output is directly associated with both the state and the input

• Mealy Machines cannot have any transitions