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. |
The O/P of Moore machine can be represented in the following format: |
| A. | Op(t)=δ(Op(t)) |
| B. | Op(t)=δ(Op(t)i(t)) |
| C. | Op(t): ∑ |
| D. | None of the mentioned |
| Answer» B. Op(t)=δ(Op(t)i(t)) | |
| 2. |
The output alphabet can be represented as: |
| A. | δ |
| B. | ∆ |
| C. | ∑ |
| D. | None of the mentioned |
| Answer» C. ∑ | |
| 3. |
What is the output for the given language?Language: A set of strings over ∑= {a, b} is taken as input and it prints 1 as an output “for every occurrence of a, b as its substring. (INPUT: abaaab) |
| A. | 0010001 |
| B. | 0010001b) 0101010 |
| C. | 0111010 |
| D. | 0010000 |
| Answer» B. 0010001b) 0101010 | |
| 4. |
Complete the given table according to the given Moore machine.Present StateNext StateOutput |
| A. | Q0, Q2, 0 |
| B. | Q0, Q2, 1 |
| C. | Q1, Q2, 1 |
| D. | Q1, Q0, 0View Answer |
| Answer» B. Q0, Q2, 1 | |
| 5. |
The total number of states and transitions required to form a moore machine that will produce residue mod 3. |
| A. | 3 and 6 |
| B. | 3 and 5 |
| C. | 2 and 4 |
| D. | 2 and 5 |
| Answer» B. 3 and 5 | |
| 6. |
Statement 1: Null string is accepted in Moore Machine.Statement 2: There are more than 5-Tuples in the definition of Moore Machine. Choose the correct option: |
| A. | Statement 1 is true and Statement 2 is true |
| B. | Statement 1 is true while Statement 2 is false |
| C. | Statement 1 is false while Statement 2 is true |
| D. | Statement 1 and Statement 2, both are falseView Answer |
| Answer» B. Statement 1 is true while Statement 2 is false | |
| 7. |
For a give Moore Machine, Given Input=’101010’, thus the output would be of length: |
| A. | |Input|+1 |
| B. | |Input| |
| C. | |Input-1| |
| D. | Cannot be predicted |
| Answer» B. |Input| | |
| 8. |
The total number of states and transitions required to form a moore machine that will produce residue mod 3. |
| A. | 3 and 6 |
| B. | 3 and 5 |
| C. | 2 and 4 |
| D. | 2 and 5 |
| Answer» B. 3 and 5 | |
| 9. |
For a give Moore Machine, Given Input=’101010’, thus the output would be of length:$ |
| A. | |Input|+1 |
| B. | |Input| |
| C. | |Input-1| |
| D. | Cannot be predicted |
| Answer» B. |Input| | |
| 10. |
In Moore machine, output is produced over the change of: |
| A. | transitions |
| B. | states |
| C. | Both |
| D. | None of the mentioned |
| Answer» C. Both | |
| 11. |
Moore Machine is an application of: |
| A. | Finite automata without input |
| B. | Finite automata with output |
| C. | Non- Finite automata with output |
| D. | None of the mentioned |
| Answer» C. Non- Finite automata with output | |