#CS-6205
Awesome StudentQuestion • Automata Theory and Formal Language

A string is accepted by a, iff the DFA/NDFA starting at the initial state ends in an after reading the string.

Answer

NDFA