$$S \rightarrow A B , A \rightarrow 0 B 1,0 B 1 \rightarrow 0$$

Q2: Determine if 1101 belongs to the

Q3: Determine if 1101 belongs to the

Q5: The productions of a phrase-structure grammar are

Q6: Find the Kleene closure of A={0,1,2}

Q6: Construct a Turing machine that computes

Q7: Suppose a phrase-structure grammar has productions

Q9: What is the language generated by the

Q33: Find the Kleene closure of A={1}

Q37: Suppose that A = {1, 11, 01}

Q39: Which strings belong to the set represented