MCQOPTIONS
Saved Bookmarks
MCQOPTIONS
This section includes 16 Mcqs, each offering curated multiple-choice questions to sharpen your Automata Theory knowledge and support exam preparation. Choose a topic below to get started.
| 1. |
8. Let h(0)=ab; h(1)=eLet L={abab,baba}h-1(L)= the language of two zeroes and any number of one’s.The given example belongs to which of the following?a) Homomorphismb) Inverse Homomorphismc) Both ( |
| A. | Homomorphismb) Inverse Homomorphismc) Both (a) and ( |
| B. | Inverse Homomorphism |
| C. | Both (a) and (b) |
| D. | None of the mentioned |
| Answer» C. Both (a) and (b) | |
| 2. |
While proving Inverse Homomorphism, which of the following steps are needed? |
| A. | Start with a DFA Ain L |
| B. | Construct a DFA B for h-1(L) |
| C. | The set of states, initial and final states should be same. |
| D. | All of the mentioned |
| Answer» E. | |
| 3. |
Let h(0)=ab; h(1)=eLet L={abab,baba}h-1(L)=_______ |
| A. | the language of two one’s and any number of zeroes |
| B. | the language of two zeroes and any number of one’s |
| C. | the language of two zeroes and two one’s |
| D. | none of the mentioned |
| Answer» C. the language of two zeroes and two one’s | |
| 4. |
Let h(L) be a language of regular expression abe*+e(ab)*. Simplify the h(L) |
| A. | (ab)*+eab*b) abe*+ea*b*c) (a |
| B. | *. Simplify the h(L)a) (ab)*+eab*b) abe*+ea*b* |
| C. | (ab)* |
| D. | None of the mentioned |
| Answer» D. None of the mentioned | |
| 5. |
Simplify the following identity:E=01*+10*ER=? |
| A. | (1*0+0*1) |
| B. | (01*10*)R |
| C. | (0*1+10*) |
| D. | All of the mentioned |
| Answer» B. (01*10*)R | |
| 6. |
If E= FG, Er=?a) FrGrb) GrFrc) Both ( |
| A. | FrGrb) GrFrc) Both (a) and ( |
| B. | GrFr |
| C. | Both (a) and (b) |
| D. | None of the mentioned |
| Answer» C. Both (a) and (b) | |
| 7. |
If E=F+G;Er=?a) Fr+Grb) (F+G)rc) Both ( |
| A. | Fr+Grb) (F+G)rc) Both (a) and ( |
| B. | (F+G)r |
| C. | Both (a) and (b) |
| D. | None of the mentioned |
| Answer» B. (F+G)r | |
| 8. |
WHILE_PROVING_INVERSE_HOMOMORPHISM,_WHICH_OF_THE_FOLLOWING_STEPS_ARE_NEEDED??$ |
| A. | Start with a DFA Ain L |
| B. | Construct a DFA B for h-1(L) |
| C. | The set of states, initial and final states should be same. |
| D. | All of the mentioned |
| Answer» E. | |
| 9. |
8._Let_h(0)=ab;_h(1)=e$ |
| A. | |
| B. | = the language of two zeroes and any number of one’s. |
| Answer» C. | |
| 10. |
Let h(0)=ab; h(1)=? |
| A. | |
| B. | =_______ |
| C. | the language of two one’s and any number of zeroes |
| Answer» C. the language of two one‚Äö√Ñ√∂‚àö√ë‚àö¬•s and any number of zeroes | |
| 11. |
Which of the following obey the closure properties of Regular language? |
| A. | Homomorphism |
| B. | Inverse Homomorphism |
| C. | Reversal |
| D. | All of the mentioned |
| Answer» E. | |
| 12. |
Simplify the following identity: |
| A. | |
| B. | |
| Answer» B. | |
| 13. |
If E= FG, Er=? |
| A. | F<sup>r</sup>G<sup>r</sup> |
| B. | G<sup>r</sup>F<sup>r</sup> |
| C. | Both (a) and (b) |
| D. | None of the mentioned |
| Answer» C. Both (a) and (b) | |
| 14. |
If E=F+G; |
| A. | |
| B. | F<sup>r</sup>+G<sup>r</sup> |
| C. | (F+G)<sup>r</sup> |
| Answer» B. F<sup>r</sup>+G<sup>r</sup> | |
| 15. |
If L is a regular language, ____ is also regular. |
| A. | L<sup>r</sup> |
| B. | L’ |
| C. | L* |
| D. | All of the mentioned |
| Answer» E. | |
| 16. |
If L is a language, the reversal of the language can be represented as: |
| A. | L’ |
| B. | L<sup>c</sup> |
| C. | L<sup>r</sup> |
| D. | more than one option is correct |
| Answer» D. more than one option is correct | |