100 +Automata Mcq Questions and Answers – Moore Machine

1. 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

2. In Moore machine, output is produced over the change of:
  •  transitions
  •  states
  •  Both
  •  None of the above

3. For a give Moore Machine, Given Input=’101010’, thus the output would be of length:
  •  |Input|+1
  •  |Input|
  •  |Input-1|
  •  Cannot be predicted

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  option below:
  •  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

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

6. Complete the given table according to the given Moore machine.
automata-theory-questions-answers-moore-machine-q6
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


7. 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)
  •  0010001
  •  0101010
  •  0111010
  •  0010000

8. 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

9. The output alphabet can be represented as:
  •  δ
  •  
  •  ∑
  •  None of the mentioned

10. Moore Machine is an application of:
  •  Finite automata without input
  •  Finite automata with output
  •  Non- Finite automata with output
  •  None of the mentioned

Post a comment

0 Comments