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

Q39: In questions determine the output for<br>-

Q40: Suppose a phrase-structure grammar has productions

Q41: Let G be the phrase-structure

Q42: Determine if 1101 belongs to the

Q43: Suppose V={S, A, a, b},

Q45: Find a deterministic finite-state automaton equivalent to

Q46: For the following Turing machine T,

Q47: Consider the Turing machine <span

Q48: Let A={0,11} . Find

Q49: What language is generated by the phrase-structure