I have the given regular language and i am suppose to check if it is regular and if it is, to provide a regular expression
However, if the language is not regular i have to prove using the "Pumping Lemma" that it is not regular
it is regular if, it can be represented by a finite state automata (FSA)
or, if it can be represented by a regular expression
L = { a^2 b^n c^m , where n,m >= 0 } Alphabet is {a,b,c}
My thoughts:
At first glance, i thought this language is regular because it can be represented by a regular expression. The regular expression that i would propose would be a^2 b^* c^*
, is this correct?