MCQOPTIONS
Saved Bookmarks
MCQOPTIONS
This section includes 11 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. |
What does the following transition graph shows: |
| A. | Copies a symbol |
| B. | Reverses a string |
| C. | Accepts a pal |
| D. | None of the mentioned |
| Answer» D. None of the mentioned | |
| 2. |
The following turing machine acts like: |
| A. | Copies a string |
| B. | Delete a symbol |
| C. | Insert a symbol |
| D. | None of the mentioned |
| Answer» C. Insert a symbol | |
| 3. |
If T1 and T2 are two turing machines. The composite can be represented using the expression: |
| A. | T1T2 |
| B. | T1 U T2 |
| C. | T1 X T2 |
| D. | None of the mentioned |
| Answer» B. T1 U T2 | |
| 4. |
d(q,X)=(r,Y,D) where D cannot be: |
| A. | L |
| B. | R |
| C. | S |
| D. | None of the mentioned |
| Answer» D. None of the mentioned | |
| 5. |
The machine accept the string by entering into hA or it can:a) explicitly reject x by entering into hRb) enter into an infinte loopc) Both ( |
| A. | explicitly reject x by entering into hRb) enter into an infinte loopc) Both (a) and ( |
| B. | enter into an infinte loop |
| C. | Both (a) and (b) |
| D. | None of the mentioned |
| Answer» D. None of the mentioned | |
| 6. |
Which of the following regular expression resembles the given diagram? |
| A. | {a}*{b}*{a,b} |
| B. | {a,b}*{aba} |
| C. | {a,b}*{bab} |
| D. | {a,b}*{a}*{b}* |
| Answer» C. {a,b}*{bab} | |
| 7. |
If T1 and T2 are two turing machines. The composite can be represented using the expression? |
| A. | T1T2 |
| B. | T1 U T2 |
| C. | T1 X T2 |
| D. | None of the mentioned |
| Answer» B. T1 U T2 | |
| 8. |
Which of the functions can a turing machine not perform? |
| A. | Copying a string |
| B. | Deleting a symbol |
| C. | Accepting a pal |
| D. | Inserting a symbol |
| Answer» E. | |
| 9. |
Which of the following can accept even palindrome over {a,b} |
| A. | Push down Automata |
| B. | Turing machine |
| C. | NDFA |
| D. | All of the mentioned |
| Answer» D. All of the mentioned | |
| 10. |
The machine accept the string by entering into hA or it can: |
| A. | explicitly reject x by entering into hR |
| B. | enter into an infinte loop |
| C. | Both (a) and (b) |
| D. | None of the mentioned |
| Answer» D. None of the mentioned | |
| 11. |
The number of states required to automate the last question i.e. {a,b}*{aba}{a,b}* using finite automata: |
| A. | 4 |
| B. | 3 |
| C. | 5 |
| D. | 6 |
| Answer» B. 3 | |