277 views
0 votes
0 votes
Which of the following is/are true?

1) every RL is DCFL.

2) R - L is always CSL but need not be CFL.

( R is regular language and L is CFL )

Here in second statement what does they actually mean by " need not be ".

1 Answer

Best answer
3 votes
3 votes

both are true 

  • every regualr is dcfl according to chomsky heiarchy (TRUE)
  • R-L

            R∩CFL'= R∩CSL= CSL this is   true according to closure table properties .but if language are implicility given than .closure table will give weak answer (result can be CFL or even Relugar for specific languages). Any way this statement  is  true  (TRUE)

selected by

Related questions

0 votes
0 votes
1 answer
3
practicalmetal asked Mar 25, 2023
374 views
The solution to $X = r +Xs$ by Arden’s Lemma when s has ϵa) an infinite number of solutionsb) a finite number of solutionsc) is always uniqued) none
0 votes
0 votes
3 answers
4
HenryAsks21 asked Mar 4, 2022
1,419 views
For the following question if True show why, and if it’s False show why.)Question: For any language A1, A2, if $A1 \cup A2$ is regular, then A1 and A2 are regular langu...