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

For a regular expression 'a', we can construct the following FA:

Answer

TRUE