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 } ManojK asked May 23, 2016 edited May 23, 2016 by ManojK ManojK 287 views answer comment Share Follow See 1 comment See all 1 1 comment reply asu commented May 23, 2016 reply Follow Share IF Y BELONGS TO {A,B} FROM WHERE 1 WILL COME 1 votes 1 votes Please log in or register to add a comment.
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 srestha answered May 26, 2016 srestha comment Share Follow See all 0 reply Please log in or register to add a comment.
0 votes 0 votes No I think its no regular since the language we get is 1k ..1k+i... 12k we cant draw FA shivanisrivarshini answered May 23, 2016 shivanisrivarshini comment Share Follow See all 0 reply Please log in or register to add a comment.
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. Prasita Mukherjee answered May 26, 2016 Prasita Mukherjee comment Share Follow See all 0 reply Please log in or register to add a comment.