It is not obvious what the connection is between BQP and NP.

Decide whether each statement is true or false. If it is true, justify youranswer. If it is not true, give a counterexample. All parts refer to languages over {0,1}.a. If L1 ⊆ L2, and L1 cannot be recognized by a FSA, then L2 cannot.b. If L1 ⊆ L2, and L2 cannot be recognized by a FSA, then L1 cannot.c. If L1 cannot be recognized by a FSA, then L1c cannot. Note: L1c is the complement of L1.d. If neither L1 nor L2 can be recognized by a FSA, then L1 ∪ L2 cannot.e. If neither L1 nor ?2 can be recognized by a FSA, then L1 ∩ L2 cannot.

Suppose a tree generated by a compound proposition X has only closed paths. Does this mean that X is a contradiction? Please explain your answer. *Suppose a tree generated by a compound proposition Y has only open paths. Does this mean that Y is a tautology? Please explain your answer.

Find a pda that accepts the language L={anb2n :n≥0}.L={anb2n :n≥0}.

Question 34 The correct statements are: Decidable languages are closed under union. Decidable languages are closed under intersection. Decidable languages are closed under complement. Semi-decidable languages are closed under complement.

Why does the class P is contained in NP?

Use the Pumping Lemma to show that the the following language over {a,b,c}* is not CF  {wct | t ∈ {a,b}* ∧ w is a substring of t}

Find Regular Grammer and Transition Graph,for the following language on {a, b}: All words that end in either a or bbb.

I need help solving 1 and 2

This question is concerned with Booleans and Lists using predicate logic in Lean.Define a function diffb : bool → bool → bool using Lean syntax which implements logical inequivalence (xor) for booleans. How would you specify diffb in Lean using ≠?