Multiple Choice
S -> aSa| bSb| a| b ; The language generated by the above grammar over the alphabet {a,b} is the set of
A) All palindromes.
B) All odd length palindromes.
C) Strings that begin and end with the same symbol
D) All even length palindromes.
Correct Answer:
Verified
Correct Answer:
Verified
Q1: Let SHAM3 be the problem of finding
Q3: Consider the languages: L<sub>1</sub> ={a^n b^n c^m
Q4: Consider the languagesL<sub>1</sub>={0^{i}1^{j}|i != j},L<sub>2</sub>={0^{i}1^{j}|i = j},L<sub>3</sub>
Q5: Let L<sub>1</sub> be a recursive language. Let
Q6: A minimum state deterministic finite automation accepting
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}