The Gateway to Computer Science Excellence
First time here? Checkout the FAQ!
x
+1 vote
27 views
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
asked in Theory of Computation by Active (1.4k points) | 27 views
0
I could not understand what Statement 1 is..

Statement 2 seems to be regular as we just need to check if the strings are of even length..
0

Infinite intersection in not regular. You can see this https://gateoverflow.in/20180/infinite-intersection-of-regular-language-is-not-regular

It did not understand the solution though.

1 Answer

0 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

answered by Boss (23.3k points)
+1
we can not draw finite automata for a^m b^m, m!=n thats why the whole language is not regular...right?
0
Yes you are right.

Related questions

0 votes
1 answer
2
asked Aug 7 in Theory of Computation by himgta Active (1.4k points) | 44 views


Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true

39,437 questions
46,622 answers
139,340 comments
57,000 users