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

The language L contains all strings over the alphabet {a,b} that begin with and end with

Answer

a,b