Consider the language L of string defined over a b ending in a-04622
Consider the language L of string, defined over Σ={a,b} ending in a
This multiple choice question (MCQ) is related to the book/course
vu cs402 Theory of Automata.
It can also be found in
vu cs402 Final Term - Quiz No.4.
Consider the language L of string, defined over Σ={a,b} ending in a
there are finite many classes generated by L,so L is regular
there are infinite many classes gnerated by L,so L is regular
there are finite many classes generated by L,so L is non regular
there are infinite many classes generated by L, soL is non regular
