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

Q3: Let A = {1, 10}. Which strings

Q5: Construct a finite-state automaton that recognizes all

Q42: Construct a finite-state machine with output that

Q61: Find a set of two productions

Q62: Find a production of the form

Q63: Suppose a phrase-structure grammar has productions

Q67: Find the language recognized by this nondeterministic

Q67: Find the Kleene closure of A={00}

Q68: Which strings belong to the regular

Q70: Find the language recognized by this nondeterministic