ACtE08 · Chapter 8Mock Test 02🏛️ Past Licensure QuestionID: b5071f60
In finite automata, a dead-end non-final state from which no accepting state can ever be reached is called a:
In finite automata, a dead-end non-final state from which no accepting state can ever be reached is called a:
Multiple Choice Options
- A
ACCEPT state
- B✓ Correct Option
REJECT / Trap state
- C
DISTINCT state
- D
START state
Detailed Technical Solution & Explanation
A dead state (trap state or reject state) in a finite automaton is a non-final state from which all transitions lead back to itself, ensuring that any input string entering this state is permanently rejected.
Option Analysis:
•
Option A (ACCEPT): Final accepting state.
•
Option B (REJECT / Trap state): Correct. Dead-end non-accepting sink state.
•
Option C (DISTINCT): Equivalence testing concept.
•
Option D (START): Initial entry state.
Reference: Mock Test 02NEC Licensure Syllabus