4 4 votes WHICH OF THE FOLLOWING LANGUAGES IS ACCEPTED BY A DETERMINISTIC PUSHDOWN AUTOMATA (DPDA)?$L_1=\left\{a^n b^n c^k \mid n, k \geq 0\right\} \cup\left\{a^i b^j c^j \mid i, j \geq 0\right\}$ $L_2=\left\{a^n b^m c^n d^m \mid n, m \geq 0\right\}$ $L_3=\left\{a^n b^n \mid n \geq 0\right\} \cup\left\{a^n b^{2 n} \mid n \geq 0\right\}$ $L_4=\left\{a^n b^n c^k d^k \mid n, k \geq 0\right\}$ Theory of Computation goclasses theory-of-computation goclasses-cs-dpp goclasses-cs-dpp-day-131 goclasses-toc-practice-questions + – GO Classes 441 views answer comment Share Follow Print 0 reply Please log in or register to add a comment.
0 0 votes Option D SAMRIDHII09 answered Nov 14, 2025 SAMRIDHII09 comment Share Follow 0 reply Please log in or register to add a comment.
0 0 votes This shows DPDA is not closed under Union. Prince_Garg answered Dec 11, 2025 Prince_Garg comment Share Follow See 1 comment 1 1 comment reply One_Last_Hope commented May 13 reply Follow flag Bro when langugae is given forgot about closure properites all beacuse closure properties may or may not right we can't say no and we can't say yes we need to check the language and find out it is or not but the property useful when ever they are not given any language . 0 0 replyShare Please log in or register to add a comment.
0 0 votes DCFL is not closed under union....due to that option A and C are not correct option B is not DCFL. So only D is true Utkarsh_Pandey answered Mar 16 Utkarsh_Pandey comment Share Follow 0 reply Please log in or register to add a comment.
