gs gs101 Finite Automata - Moore Machine - Quiz No.1
gs gs101 Automata Theory Quiz
This quiz belongs to book/course code gs gs101 Automata Theory of gs organization. We have 92 quizzes available related to the book/course Automata Theory. This quiz has a total of 10 multiple choice questions (MCQs) to prepare and belongs to topic Finite Automata. NVAEducation wants its users to help them learn in an easy way. For that purpose, you are free to prepare online MCQs and quizzes.
NVAEducation also facilitates users to contribute in online competitions with other students to make a challenging situation to learn in a creative way. You can create one to one, and group competition on an topic of a book/course code. Also on NVAEducation you can get certifications by passing the online quiz test.
Question 1: Moore Machine is an application of:
Finite automata without input
Finite automata with output
Non Finite automata with output
None of the mentioned
Question 2: In Moore machine, output is produced over the change of:
transitions
states
all of the mentioned
none of the mentioned
Question 3: For a give Moore Machine, Given Input=’101010’, thus the output would be of length:
|Input|+1
|Input|
|Input-1|
Cannot be predicted
Question 4: 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:
Statement 2: There are more than 5-Tuples in the definition of Moore Machine.
Choose the correct option:
Statement 1 is true and Statement 2 is true
Statement 1 is true while Statement 2 is false
Statement 1 is false while Statement 2 is true
Statement 1 and Statement 2, both are false
Question 5: The total number of states and transitions required to form a moore machine that will produce residue mod 3.
3 and 6
3 and 5
2 and 4
2 and 5
Question 6: Complete the given table according to the given Moore machine.
Present State Next State Output 0 1 Q0 Q1 Q2 1 Q1 Q2 1 Q2 Q0
Q0, Q2, 0
Q0, Q2, 1
Q1, Q2, 1
Q1, Q0, 0
Question 8: The output alphabet can be represented as:
δ
∆
∑
None of the mentioned
Question 9: The O/P of Moore machine can be represented in the following format:
Op(t)=δ(Op(t))
Op(t)=δ(Op(t)i(t))
Op(t): ∑
None of the mentioned
Question 10: Which of the following is a correct statement?
Moore machine has no accepting states
Mealy machine has accepting states
We can convert Mealy to Moore but not vice versa
All of the mentioned
Online Quizzes of gs101 Automata Theory
Other Classes Of Problems - Randomized Algorithm - Quiz No.1
gs gs101
Automata Theory Online Quizzes
Push Down Automata - DPDA and Ambiguous Grammars - Quiz No.1
gs gs101
Automata Theory Online Quizzes
