Redirected
in Theory of Computation retagged by
1,484 views
2 votes
2 votes

Which of the following statement is true?

  1. Deterministic context free language are closed under complement.
  2. Deterministic context free language are not closed under Union.
  3. Deterministic context free language are closed under intersection with regular set.
  4. All of the options
in Theory of Computation retagged by
by
1.5k views

1 comment

As per the question, second option is "Deterministic context free language is not closed under union". So all the options mentioned in NIELIT Scientist-B Dec 2017_59 was true. Answer is D.

0
0

3 Answers

2 votes
2 votes
Best answer
As per the question, second option is "Deterministic context free language is not closed under union".

→ Deterministic Context free language are closed under complement
→ Deterministic Context free language are not closed under union
→ Deterministic Context free language are closed under intersection with regular set

correct option -D
selected by
1 vote
1 vote
Option A and C both are true.

2 Comments

Deterministic Context Free Language are NOT closed under intersection. Option C is false. Option B, however, is correct because DCFL are not closed under union either.

0
0
Intersection with regular set - dcfl is closed under this.
0
0
0 votes
0 votes
Deterministic context free languages are closed under complementation . So correct answer will be A option

1 comment

DCFL is also closed under "Union and Intersection with regular set".

0
0
Answer:

Related questions