Is the language given below regular or not ?
I feel it is regular.
The equivalent language is, L = {anblak ; n>=1,l>=1,k>=1 } - { a1b1a1 , a1b1a2 , a1b1a3 , a1b2a1 , a1b2a2 , a1b3a1 and few more strings (but finite number of strings) }
We know that every finite language is a regular language and also set difference between any two regular languages is regular ... So can we say that the above language is regular ...
QUESTION TAKEN FROM PETER LINZ TEXTBOOK AND ANSWER WAS NOT GIVEN. So please verify whether i am correct ...???