Is L={0, 011, 011000, 0110001111, ....} a regular language?
I know that the language should follow some regular pattern and we should be able to construct a regex for it in order to say it a RL. Morever it shouldnt require any kind of extra memory to store the counts.
BUT, in this given language, I can see a regular pattern, but I am not able to construct a regex. And I think that prevois count should be remembered by the m/c.. So it should be NRL. But my book says its a RL. I am not getting how??
P.S. I wud be thankful if somebody suggests a quick method to identify given set to be RL or NRL based on pattern.
Thanks in advance :)