Register

SELF DOUBT DCFL

• recategorized by
609 views
0 0 votes
SUPPOSE WE HAVE A SITUATION IN BETWEEN LIKE THIS

(DCFL) INTERSECTION (REGULAR LANG)..............................SITUATION 1

NOW WE CAN WRITE DCFL IN PLACE OF REGULAR

SO IT WILL BECOME DCFL INTERSECTION DCFL

AND WE KNOW DCFL IS NOT CLOSED UNDER INTERSECTION MAY BE DCFL OR NOT BE DCFL HENCE SAYING IT DCFL IS WRONG...

BUT TAKING OTHER VIEW THAT SITUATION 1 CAN BE READ AS DCFL IS CLOSED UNDER REGULAR INTERSECTION HENCE DCFL ...........WHY THIS CONTRADICTION IS ARISING??????

1 Answer

Voting & Accepting an answer helps improve the community
← Previous · c programmingNext → · Eigen vector
← Previous in category · closure properties o...Next in category → · doubt toc
Position:
Show:

Related questions

1 1 vote
2 2 answers
64
64 views
GO Classes asked Sep 23
64 views
GO Classes DPP | GATE CS | Theory of Computation | DCFL Reversal
Suppose $L$ is a deterministic context-free language.Which of the following is always correct about$$L^R=\{w^R\mid w\in L\}?$$$L^R$ must be regular. $L^R$ must be determi...
2 2 votes
2 2 answers
96
96 views
GO Classes asked Sep 23
96 views
GO Classes DPP | GATE CS | Theory of Computation | DCFL Classification
Consider $$L= \{a^ib^jc^k\mid i=j\text{ or }j=k\}.$$ Which of the following correctly classifies $L$?$L$ is regular. $L$ is DCFL but not regular. $L$ is CFL but not DCFL....
1 1 vote
1 1 answer
48
48 views
GO Classes asked Sep 23
48 views
GO Classes DPP | GATE CS | Theory of Computation | DCFL Closure
Let $L_1,L_2$ be deterministic context-free languages and let $R$ be a regular language.Which of the following statements are always true?$L_1\cup L_2$ is deterministic c...
3 3 votes
1 1 answer
96
96 views
GO Classes asked Sep 17
96 views
GO Classes DPP | GATE CS | Theory of Computation | DCFL
Let $L=\{w\in\{a,b\}^*\mid n_a(w)\ne n_b(w)\}$. Which statements are correct?$L$ is regular. $L$ is DCFL. $L$ is not CFL. A DPDA can maintain the current surplus using th...