in Theory of Computation edited by
283 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 }

in Theory of Computation edited by
by
283 views

1 comment

IF Y BELONGS TO {A,B} FROM WHERE 1 WILL COME
1
1

3 Answers

1 vote
1 vote

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

0 votes
0 votes

No I think its no regular since the language we get is 1k ..1k+i... 12k we cant draw FA

0 votes
0 votes
I think it is not regular . y is 0*(0+1)^k0* . But we cannot keep a count of 1^k  before.