Question

State true or false?

(a) Statement: An NFA can be modified to allow transition without input alphabets, along with one or more transitions on input symbols.

(b) True

(c) False

This question was posed to me at a job interview.

I would like to ask this question from Finite Automata with Epsilon Transition in section Finite Automata of Automata Theory

Answer 1

The correct choice is (a) Statement: An NFA can be modified to allow transition without input alphabets, along with one or more transitions on input symbols.

For explanation: It is possible to construct an NFA with ε-transitions, presence of no input symbols, and that is called NFA with ε-moves.