NFA doesn’t require to show transitions for all input symbols in alphabet set over a statea.falseb.true

Answer

The statement is true.

A Non-deterministic Finite Automaton (NFA) is a type of automaton where for a given state and input symbol, it is possible to move to zero, one, or multiple states. Unlike Deterministic Finite Automata (DFAs), NFAs do not require a transition for every possible input symbol from every state. This means that there can be states in an NFA that do not have defined transitions for certain symbols in the input alphabet.

To summarize, the nature of NFAs allows them to be more flexible than DFAs, as they can "choose" among multiple transitions or even opt not to transition at all for some inputs from a given state.