735 views
2 votes
2 votes
Statement I: Li be regular language i = 1, 2, . . ., ∞
Language ⋂ ∞=1is regular i.e. Infinite intersection.
Statement II: L = {wx | w ∈ Ʃ*, x ∈ Ʃ*, |w| = |x|} is regular.

(a) Both are True (b) Both are False
(c) S1 → True, S2 → False (d) S1 → False, S2 → True

1 Answer

1 votes
1 votes
  • Infinite intersection of regular language may or may not be regular. So option a is false.

  • Second one is regular becz we can write regular expression for this

So Option d is right

Related questions

0 votes
0 votes
0 answers
1
himgta asked Aug 31, 2018
246 views
https://gateoverflow.in/21039/simplified-cfgDoubt in the solution....plz help!
0 votes
0 votes
1 answer
2
himgta asked Aug 7, 2018
349 views
0 votes
0 votes
0 answers
3
himgta asked Jul 31, 2018
397 views
https://gateoverflow.in/188609/me-test-seriesThis question has not been answered, can somebody solve it!
1 votes
1 votes
2 answers
4
himgta asked Jul 31, 2018
2,013 views
Consider the following CFG.S → aSa | bSb | a | b | εFor the above CFG, the total number of strings generated whose length is less than or equal to 8 [exclude the empty...