Multiple Choice
Consider the following statements about the context free grammarG = {S - >SS, S - >ab, S - >ba, S - ?}I. G is ambiguousII. G produces all strings with equal number of a's and b'sIII. G can be accepted by a deterministic PDA.Which combination below expresses all the true statements about G?
A) 1 only
B) 1 and 3
C) 2 and 3
D) 1,2 and 3
Correct Answer:
Verified
Correct Answer:
Verified
Q7: If s is a string over (0
Q8: Consider the following two problems on undirected
Q9: Consider the set of strings on
Q10: For S € (0+1)* let d(s)denote the
Q11: Consider the language L<sub>1</sub>,L<sub>2</sub>,L<sub>3</sub> as given below.<br>L<sub>1</sub>={0^{p}1^{q}
Q13: The minimum state automaton equivalent to the
Q14: Let L<sub>1</sub> be a recursive language, and
Q15: Definition of a language L with alphabet
Q16: Let L<sub>1</sub> be a regular language, L<sub>2</sub>
Q17: Consider the regular language L =(111+11111)*. The