CS401 T01

1. Which of the following terms is synonymous with Finite Automata?

• Finite State Machine

• Infinite State System

• Turing Machine

• Infinite Automaton

2. A Finite Automaton is defined by all the following EXCEPT:

• States

• Transition rules

• Initial state

• Unlimited memory

3. In a Finite Automaton, what does a "transition" represent?

• A loop in the system

• A change from one state to another

• A termination of the process

• A decrease in computational power

4. Which of these best describes a practical application of Finite Automata?

• Managing network protocols

• Simulating physical objects

• Representing infinite languages

• Solving calculus equations

5. A "trap" state in Finite Automata is a state that:

• Can only be exited once

• Has no transitions out of it

• Leads directly to the start state

• must be a reject state

6. Which symbol commonly represents an empty string in Finite Automata?

• 0

• Σ

• ε

• ∆

7. Which of these languages is most relevant to Finite Automata?

• Regular languages

• Context-free languages

• Natural languages

• Non-Regular languages

8. A transition table in an FSM shows:

• The probabilities of state changes

• The state changes based on inputs

• The time taken for each transition

• Only the final state of the system

9. Why is a Finite Automaton called "finite"?

• It can process only finite amounts of data

• It completes all tasks in finite time

• It has a finite number of states and transitions

• It has infinite memory

10. Finite Automata with only one possible transition for each symbol and state are called:

• Universal Automata

• Context-Free Automata

• Non-deterministic Finite Automata

• Deterministic Finite Automata