$$S \rightarrow 1 A , A \rightarrow 1 , S \rightarrow \lambda$$

Q7: Construct a finite-state machine that models a

Q24: Determine if 1101 belongs to the regular

Q26: For the following Turing machine T,

Q28: Suppose a phrase-structure grammar has productions

Q29: Find all strings recognized by this deterministic

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

Q32: Determine if 1101 belongs to the

Q34: Which strings are recognized by the following

Q35: Suppose a phrase-structure grammar has productions

Q36: <span class="ql-formula" data-value="\text { Find the set