MCQ
Q.
Which of the following is not a part of 5-tuple finite automata?
Correct Answer: D
A FA can be represented as FA = (Q, ?, ?, q0, F) where Q=Finite Set of States, ?=Finite Input Alphabet, ?=Transition Function, q0=Initial State, F=Final/Acceptance State).