The automaton which allows transformation to a new state without consuming any input symbols: ans. NFA-l NFA All of the mentioned DFA

The automaton that allows transformation to a new state without consuming any input symbols is the NFA-l (Non-deterministic Finite Automaton with λ-transitions).

Here's a step-by-step explanation:

1. An automaton is a mathematical model for designing computer programs and digital logic circuits. It is a system where information can be in one of a finite number of states.

2. The automaton can change from one state to another when external inputs are given. These changes are called transitions.

3. In some automata, transitions can occur without any input. These are called λ-transitions or epsilon transitions.

4. The Non-deterministic Finite Automaton with λ-transitions (NFA-l) is one such automaton where λ-transitions are allowed. This means the NFA-l can move to a new state without consuming any input symbols.

5. DFA (Deterministic Finite Automaton) does not allow λ-transitions. In a DFA, for each state and each input symbol, there is one and only one transition to a new state.

6. An NFA (Non-deterministic Finite Automaton) without λ-transitions also does not allow transitions without consuming input symbols.

7. Therefore, among the options given, only the NFA-l allows transformation to a new state without consuming any input symbols.

So, the correct answer is NFA-l.