Recent questions without a selected answer

Which statement about deterministic context-free languages is correct?DCFLs are closed under reversal. If $L$ is a DCFL, then $L^R$ must also be a DCFL. There exists a DC...

Let $L_1$ be a DCFL and $R$ be a regular language over the same alphabet. Which languages are guaranteed to be DCFL?$L_1\cap R$ $L_1\cup R$ $L_1-R$ $L_1^R$ $L_1\cap L_2$,...

Let $L_1=\{a^i b^j c^i \mid i,j>0\}$ and $L_2=\{a^i b^i c^j \mid i,j>0\}$. Which statements are correct?$L_1$ is a DCFL. $L_2$ is a DCFL. $L_1\cap L_2=\{a^n b^n c^n \mid ...

A language accepted by a DPDA using empty-stack acceptance must have the prefix property, meaning no accepted string can be a proper prefix of another accepted string. Wh...

Let $L$ be a regular language accepted by a DFA $D=(Q,\Sigma,\delta,q_0,F)$. Which construction correctly proves that $L$ is a deterministic context-free language?Make a ...

Consider $R(A,B,C,D,E)$ with $F=\{A\to DE,\ BE\to C,\ D\to B,\ C\to A\}$.The relation is decomposed into $R_1(A,B,C)$ and $R_2(A,D,E)$.Which of the following statements a...

Consider $R(A,B,C,D,E,F)$ with $F=\{C\to D,\ A\to B,\ B\to EF,\ F\to A\}$.Suppose $R$ is decomposed into $R_1(A,B,D,E)$ and $R_2(A,B,C,F)$. The decomposition is currently...

Consider the binary decomposition$R(A,B,C,D)\to R_1(A,C,D),R_2(B,C)$.Which of the following statements are correct?If $C$ is a candidate key for $R_1$, the decomposition ...