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

A language is regular if and only if.

Answer

Accepted by DFA