Consider the language L of strings defined over a b ending in a-04922
Consider the language L of strings, 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 Mid Term - Quiz No.13.
Consider the language L of strings, defined over Σ = {a,b}, ending in a
There are finite many classes generated by L, so L is regular
There are infinite many classes generated by L, so L is regular
There are finite many classes generated by L, so L is non Jregular
There are infinite many classes generated by L, so L is non-regular
