Explain whether the following language is regular or not ?
L={1k y | y∈{o,1}* , y contain at most k ones }
It is not regular
y contains upto k 1's
means k no of 1s then any no of 0s and upto k no. of more 1s
So, it will represent infinite union
and regular language not closed under infinite union
No I think its no regular since the language we get is 1k ..1k+i... 12k we cant draw FA
64.3k questions
77.9k answers
243k comments
79.7k users