The Gateway to Computer Science Excellence
First time here? Checkout the FAQ!
+1 vote
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 (2.6k points) | 34 views
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..

Infinite intersection in not regular. You can see this

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 (24.2k points)
we can not draw finite automata for a^m b^m, m!=n thats why the whole language is not regular...right?
Yes you are right.

Related questions

0 votes
1 answer
asked Aug 7 in Theory of Computation by himgta Active (2.6k points) | 50 views
+1 vote
2 answers
asked Jul 14 in Theory of Computation by himgta Active (2.6k points) | 58 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

44,019 questions
49,545 answers
65,769 users