Answer Happy

(answer all please)
QUESTION 21 Which listing of elements correctly describes set (2X+1K is an odd Integer between 1 and 5, inclusive) OA (1,3,5,7,91 OB (1,5,9) OC. (3.7, 11) OD. (3,5,7,9,11) QUESTION 22 A conditional statement is trivially true if: O A. its conclusion is true Ов, its hypothesis is true OC. its hypothesis is false O D. its conclusion is false

QUESTION 23 1 points Let A = (a, e), which of the following is true? OA (a) EA O B. (a) CA Ос. А D. both B and C QUESTION 24 1 points Sort DFA, NFA, deterministic PDA, non-deterministic PDA, deterministic TM, non-deterministic TM into an increasing order of computability power O A DFA, NFA, deterministic PDA and non-deterministic PDA tiod, deterministic TM, non-deterministic TM O B. DFA, NFA, deterministic PDA, non-deterministic PDA, deterministic TM, non-deterministic TM OCDFA and NFA tied, deterministic PDA, non-deterministic PDA, deterministic TM, non-deterministic TM ODDFA and NFA tied, deterministic PDA, non-deterministic PDA, deterministic TM and non-deterministic TM tied

QUESTION 25 1 points asem Which statement about the Turing machine is correct? O A Deterministic Turing machine and non-deterministie Turing machine both only recognize context-free languages. OB Deterministic Turing machine is equally powerful to non-deterministic Turing machine OC. Deterministic Turing machine only recognizes context-free languages, while non-deterministic Turing machine can recognize context-sensitive languages. OD. Deterministie Turing machine is less powerful than non-deterministic Tuning machine. 1 points WA QUESTION 26 The following is a Turing machine that adds 2 to a natural number represented as a binary string. The tape head is pointing to the right most digit of the input number at the beginning. The tape head points to the left most digit of the output number when the computation finishes. O is the start state. Find out what is the missing instruction (0, 0, 0, L, 1) (0, 1, 1. L. 1) (1, 1, 1, S, halt) (1,0,1, S, halt) OA (1,1,0, 1.0) OB(1,1,0,1,1) OC (1,1,1, S, halt Save Ale Save and inahit. Click SAN Answers to see all answer

The following is a Turing machine that adds 2 to a natural number represented as a binary string. The tape head is pointing to the right most digit of the input number at the beginning. The tape head points to the left most digit of the output number when the computation finishes. O is the start state. Find out what is the missing instruction (0, 0, 0, L. 1) (0, 1, 1. L. 1) (1.A, 1, S, halt) (1.0.1, S, halt) A(1,1,0, L, 0) OB.(1.1, 0, L, 1) OC (1.1.1, S, halt) OD. (1,1,0, S, halt) 1 point QUESTION 27 Which definition of the Turing machine is most powerful? O A Original definition OB. The definition with multi-head OC The definition with one-way infinite tape OD. They are all equally powerful LALA las

Question Completion Status: 1 points QUESTION 28 The following is a Turing machine that starts with the symbol # in one cell, where all other tape cells are blank. The beginning position of the tape head is not known. The machine halts with tape head pointing at the cell containing #. O is the start state. Tape actions in two instructions are missing. What should be the missing actions, in the same order of the instructions as they appear in the instruction sequence? (0, #. #. S, halt) (0, A, X, L, 1) (0, X, X_,0) (1.#.#, S, halt) (1, A, X, RO) (1, X, X,1) OARL OB.L,R OC. RR ODLL

points QUESTION 29 Consider the following empty stack PDA, where state is the initial state and is the initial stack symbok coa, S.push(x), > (Rule 1) <D, a, X.push(X), O (Rule 2) <0, 0, X, pop, 1> (Rule 3) <0, A, S, pop, 2 (Rule 4) <1, 6, X, pop, 1> (Rule 5) <1, a. S.push(X), (Rule 6) <I, a, X.push(X). (Rule) <1.1. S. pop, 2> (Rule 8) In order to show whether input string aabba belongs to this PDA, PDA computation sequence (le, the sequence of Instantaneous Descriptors (ID) and the PDA instruction that caused each ID) is written as follows. The last step is missing. What is the last step? abbaa $> Start cabba, X Rule 1 O, abb, XXS <1. ab, X$) Rule 3 <1.a, S Rule 5 Rule 2 OA,A,A O, A XS OC. 2.A, A AVE Rule 4 Rule 7 Rule & Save and Click Save and Submit to so and submit Chick Se All Arts

Consider the following empty stack PDA, where state is the initial state and is the initial stack symbok 0, a. S. push(X), O (Rule 1) <0, 0, X, push(x), 0> (Rule 2) <0, b, X, pop, 1> (Rule 3) 0.A.S. pop. 2 (Rule 4) <1, b, X, pop, 15 (Rule 5) <1, a, 5. push(X). 0 (Rule 6) <1.a, X, push(X), O (Rule 7) 1. A. S. pop. 2> (Rule 8) In order to show whether input string aabba belongs to this PDA a PDA computation sequence (ie the sequence of Instantaneous Descriptors (ID) and the PDA instruction that caused cach ID) is written as follows. The last step is missing. What is the last step? O, abban, Start <0. abba, X5> Rule 1 co. abb. XX$ Rule 2 <1. ab, X$> Rule 3 <1, a, Rule 5 OA 2.1.1 OB 0.A. XS OC 2,1,A O0.0, A, X Rule 4 Rule 7 Rule 8 Rule 6 SASA Sare and Sub

M Question Completion Status 1 points QUESTION 30 The following PDA works for language Labin,m 20).X is the PDA start symbol, O. is the initial state, and 3 is the final state. One instruction is missing the stack operation. What is the missing stack operation? (o, n, X, пор, 3) (0.a, X, push(A), o) (0, a, A. push(A). O) (0,b, X, nop, 1) (0, b, A, nop. 1) (0.c, A. pop. 2) (1, b, x, пор. 1) (1, b, A 1) (1. c. A, pop, 2) (2, 4, X, пор, 3) (2, c. A, pop. 2) OArop OB.push(C) oc push(B) D.pop