edited by
287 views
0 votes
0 votes

Explain whether the following language is  regular or not ?

L={1k y | y∈{o,1}* , y contain at most k ones }

edited by

3 Answers

1 votes
1 votes

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 related questions found