The automaton which allows transformation to a new state without consuming any input symbols:ans.NFA-lNFAAll of the mentionedDFA

The automaton that allows transformation to a new state without consuming any input symbols is known as NFA-l (Non-deterministic Finite Automaton with null moves or lambda transitions).

Here's a step-by-step explanation:

1. An automaton is a mathematical model for a finite state machine (FSM). It's a concept used in computer science and mathematics, particularly in the theory of computation and automata theory.

2. There are several types of automata, including Deterministic Finite Automaton (DFA), Non-deterministic Finite Automaton (NFA), and Non-deterministic Finite Automaton with lambda transitions (NFA-l).

3. In a DFA, for each state and input symbol, there is exactly one transition to a new state. It doesn't allow for any ambiguity in terms of the next state of the system.

4. An NFA, on the other hand, allows for multiple possible next states for a given state and input symbol. This means there can be several possible paths the system can take, hence the term "non-deterministic."

5. An NFA-l is a special type of NFA where transitions to new states can occur without consuming any input symbols. These are called lambda or null transitions.

So, the answer to your question is NFA-l.