Recent questions tagged goclasses-cs-dpp-day-376

Let $L_1$ and $L_2$ be regular languages and let $L_3$ be non-regular. Which statements are always true?$L_1=L_2$ iff $L_1\cap\overline{L_2}=\emptyset$ $L_1\cup L_3$ is n...

Consider,Statement $1:$ If a language family is closed under union and complement, then it must also be closed under intersection. Statement $2:$ An NFA can be constructe...

Which statements are true?Every language recognized by an $n$-state DFA can be recognized by an NFA with $n$ states. Every language recognized by an $n$-state NFA can be ...

Let $L_1$ be regular where specified. Which of the following languages are guaranteed to be regular?$\{ww\mid w\in{0,1}^*\}$ $\{ww\mid w\in L_1\}$ $\{w\mid ww\in L_1\}$ $...

All languages are over $\{0,1\}$. Which statements are true?If $L_1\subseteq L_2$ and $L_2$ is regular, then $L_1$ must be regular. If $L_1$ and $L_2$ are both non-regula...

Consider $R(A,B,C,D,E)$ with $\Sigma=\{A\to B,\ AE\to D,\ B\to E,\ AD\to E,\ CD\to A,\ AB\to D,\ E\to B\}$.Which of the following correctly gives a lossless, dependency-p...

Which statement correctly describes the guarantee of the standard BCNF decomposition procedure?Every relation has a decomposition that is simultaneously BCNF, lossless an...

Consider $R(A,B,C,D,E,F)$ with $F=\{A\to B,\ A\to C,\ BC\to E,\ BC\to D,\ E\to F,\ BC\to F\}$.Suppose the following BCNF decomposition is used:$R_1(B,C,E)$$R_2(B,C,F)$$R_...

Consider $R(A,B,C,D,E,F,G)$ with $F=\{AB\to CF,\ CD\to EA,\ E\to ABC,\ B\to F,\ C\to D\}$.Suppose $R$ is decomposed into $R_1(A,B,C,D,E,G)$ and $R_2(B,F)$.Which statement...

Consider $R(A,B,C,D,E,F,G)$ with $F=\{BCD\to A,\ BC\to E,\ A\to F,\ F\to G,\ C\to D,\ A\to G\}$.Which of the following statements are correct after applying the $\text{3N...