MCQOPTIONS
Saved Bookmarks
MCQOPTIONS
This section includes 14 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. |
RR* can be expressed in which of the forms: |
| A. | R+ |
| B. | R- |
| C. | R+ U R- |
| D. | R |
| Answer» B. R- | |
| 2. |
Concatenation of R with Ф outputs: |
| A. | R |
| B. | Ф |
| C. | R.Ф |
| D. | None of the mentioned |
| Answer» C. R.Ф | |
| 3. |
Concatenation Operation refers to which of the following set operations: |
| A. | Union |
| B. | Dot |
| C. | Kleene |
| D. | Two of the options are correct |
| Answer» C. Kleene | |
| 4. |
The given NFA corresponds to which of the following Regular expressions? |
| A. | (0+1) *(00+11) (0+1) * |
| B. | (0+1) *(00+11) *(0+1) * |
| C. | (0+1) *(00+11) (0+1) |
| D. | (0+1) (00+11) (0+1) * |
| Answer» B. (0+1) *(00+11) *(0+1) * | |
| 5. |
If R represents a regular language, which of the following represents the Venn-diagram most correctly? |
| A. | An Irregular Set |
| B. | R* |
| C. | R complement |
| D. | R reverse |
| Answer» C. R complement | |
| 6. |
Which among the following looks similar to the given expression? ((0+1). (0+1)) * |
| A. | {xϵ {0,1} *|x is all binary number with even length} |
| B. | {xϵ {0,1} |x is all binary number with even length} |
| C. | {xϵ {0,1} *|x is all binary number with odd length} |
| D. | {xϵ {0,1} |x is all binary number with odd length} |
| Answer» B. {xϵ {0,1} |x is all binary number with even length} | |
| 7. |
According to the given language, which among the following expressions does it corresponds to?Language L={xϵ{0,1}|x is of length 4 or less} |
| A. | (0+1+0+1+0+1+0+1)4 |
| B. | (0+1)4 |
| C. | (01)4 |
| D. | (0+1+ε)4View Answer |
| Answer» E. | |
| 8. |
Which of the following does not represents the given language?Language: {0,01} |
| A. | 0+01 |
| B. | {0} U {01} |
| C. | {0} U {0}{1} |
| D. | {0} ^ {01} |
| Answer» E. | |
| 9. |
CONCATENATION_OPERATION_REFERS_TO_WHICH_OF_THE_FOLLOWING_SET_OPERATIONS:?$ |
| A. | Union |
| B. | Dot |
| C. | Kleene |
| D. | Two of the options are correct |
| Answer» C. Kleene | |
| 10. |
Concatenation of R with –§ outputs:$# |
| A. | R |
| B. | –§ |
| C. | R.–§ |
| D. | None of the mentioned |
| Answer» B. ‚Äö√Ñ√¨¬¨√ü | |
| 11. |
Which among the following looks similar to the given expression? |
| A. | . (0+1)) * |
| B. | {xϵ {0,1} *|x is all binary number with even length} |
| C. | {xϵ {0,1} |x is all binary number with even length} |
| D. | {xϵ {0,1} *|x is all binary number with odd length} |
| Answer» C. {x‚âà√¨¬¨¬µ {0,1} |x is all binary number with even length} | |
| 12. |
(0+1+0+1+0+1+0+1)4 |
| A. | (0+1)<sup>4</sup> |
| B. | (01)<sup>4</sup> |
| C. | (0+1+ε)<sup>4</sup> |
| Answer» B. (01)<sup>4</sup> | |
| 13. |
A language can be generated from simple primitive language in a simple way if and only if |
| A. | It is recognized by a device of infinite states |
| B. | It takes no auxiliary memory |
| C. | Both are correct |
| D. | Both are wrong |
| Answer» C. Both are correct | |
| 14. |
L is a regular Language if and only If the set of __________ classes of IL is finite. |
| A. | Equivalence |
| B. | Reflexive |
| C. | Myhill |
| D. | Nerode |
| Answer» B. Reflexive | |