Question

What is the transitional function of a DFA?

(a) Q X Σ→Q

(b) Q X Σ→2Q

(c) Q X Σ→2n

(d) Q X Σ→Qn

This question was posed to me during an interview.

I want to ask this question from Finite Automata topic in section Finite Automata and Regular Expression of Compiler

Answer 1

Correct option is (a) Q X Σ→Q

To explain I would say: Q is the finite set and let be a finite set of symbols so Q X Σ fives no of states.