6. Let S be the following truth-functional schema: (pl. q) v (r = s) Specify substitution...
Question 12 Let p, q and r be simple declarative statements. Which alternative provides the truth values for the biconditional ‘?, of the compound statement provided in the given table? q ? p) and Hint: Determine the truth values of p ? r, q v r, (p ? r) ^ (q v r), q ? p, (q-p) rin separate columns before determining the truth values of TIFF FTF F F T
Consider the schema R=(A, B, C, D, E) and let the following set F of functional dependencies hold for R: F= {A → BC, CD → E, B D } Problem 3 Suppose that the schema R=(A, B, C, D, E) is decomposed into R/ - (A, B, C) and R=(A, D, E). Show if this decomposition is a lossless decomposition with respect to the given set of functional dependencies F.
6. (20) Let G = (V, ∑, R, S) be a grammar with V = {Q, R, T}; ∑ = {q, r,ts}; and the set of rules: S→Q Q→q | RqT R→r | rT | QQr T→t | S| tT a. (5) Convert G to a PDA using the method we described. b. (15) Convert G to Chomsky normal form. 6. (20) Let G = (V, , R, S) be a grammar with V = {Q, R, T}; { =...
QUESTION 2 a. Let p and q be the statements. i Construct the truth table for (-p V q) ^ q and (-p) v q. What do you notice about the truth tables? Based on this result, a creative student concludes that you can always interchange V and A without changing the truth table. Is the student, right? ii. Construct the truth tables for (-p VG) A p and (-p) v p. What do you think of the rule formulated...
Find the dual of the equivalence without a truth table: p V (q → r) ≡ (p V q) → (p V r)
2. Construct a truth table for the statement: p q v r. ~r
SUPER-LONG TRUTH TABLE METHOD Determine the validity using the super-long truth table method. P>~Q,~Q>~(R&S):P>(~R&~S)
6.(20) Let G=(V, S, R, S) be a grammar with V = {Q, R, T}; { = {q, r,ts}; and the set of rules: SQ Qq RqT R~rrt Qor T>t | ST a. (5) Convert G to a PDA using the method we described. b. (15) Convert G to Chomsky normal form.
(20) Let G = (V, ∑, R, S) be a grammar with V = {Q, R, T}; ∑ = {q, r, ts}; and the set of rules: S → Q Q → q | RqT R → r | rT | QQr T → t | S| tT Convert G to a PDA.
SHORT TRUTH TABLE METHOD Determine the validity using the short truth table method. P>Q,~R>~S,~(Q&~S):~PvR