Finite automata with output MCQ

Errorlogger
0
1. In Moore machine the output depends on
a) Only present state
b) Present state and present input
c) Nothing
d) Type of input


2. In Mealy machine the output depends on
a) Only present state
b) Present state and present input
c) Nothing
d) Type of input


3. Which of the following statement is true?
a) A Mealy machine has no terminating state
b) A Moore machine has no terminating state
c) Converting from Mealy into Moore machine and vice versa is possible
d) All of these


4. Which of the following statement is true?
a) Moore machine consist of six tuples
b) Mealy machine consist of six tuples
c) Both (a) and (b)
d) None of these


5. In Moore machine is of length n then the output string length will be
a) n+1
b) n
c) n + n
d) none of these


6. In Moore machine is of length n then the output string length will be
a) n+1
b) n
c) n + n
d) none of these


7. The output alphabet in Moore machine can be represented formally as
a) ∆
b) ∑
c) δ


8. Mealy and Moore machines are also called
a) Turing machines
b) Transducer
c) Linear bounded automata
d) All of these


9. The output of Moore machine can be defined as
a) O(t) = λ(q(t))
b) O(t) = λ(q(t) i(t))
c) O(t) = ∑
d) None of these


10. The output of Mealy machine can be defined as
a)  O(t) = λ(q(t))
b)  O(t) = λ(q(t) i(t))
c)  O(t) = ∑
d)  None of these
Tags

Post a Comment

0Comments

Post a Comment (0)

#buttons=(Accept !) #days=(30)

Our website uses cookies to enhance your experience. Check Now
Accept !