1,413 views
2 votes
2 votes
Let L be a regular language over {a,b},   Suppose a new language defined as follows,

L = x1 , x2, x3, x4,........

L1 = x5, x10, x15 .....

L1 is defined as taking every string which is at positon 5, 10, 15 and so on, in other words, the positions that can be divided by 5.

Is L1 regular?

Please log in or register to answer this question.

Related questions

0 votes
0 votes
1 answer
1
M_Umair_Khan42900 asked Dec 29, 2022
743 views
Show that the following pairs of regular expressions define the same language over the alphabet I = [a, b].s(a) p(pp)*( A + p)q + q and p*q(b) A +0(0+1)* + (0+1)* 00(0+1)...
0 votes
0 votes
2 answers
4
iarnav asked Dec 22, 2018
624 views
WXW^R where W,X belongs to (0,1)*W^R is reverse of a string!