adplus-dvertising
frame-decoration

Question

Which of the given are correct?

a.

Moore machine has 6-tuples

b.

Mealy machine has 6-tuples

c.

Both Mealy and Moore has 6-tuples

d.

None of the mentioned

Answer: (c).Both Mealy and Moore has 6-tuples

Engage with the Community - Add Your Comment

Confused About the Answer? Ask for Details Here.

Know the Explanation? Add it Here.

Q. Which of the given are correct?

Similar Questions

Discover Related MCQs

Q. The O/P of Mealy machine can be represented in the following format:

Q. The ratio of number of input to the number of output in a mealy machine can be given as:

Q. Mealy and Moore machine can be categorized as:

Q. The major difference between Mealy and Moore machine is about:

Q. Statement 1: Mealy machine reacts faster to inputs.
Statement 2: Moore machine has more circuit delays.

Choose the correct option:

Q. Which one among the following is true?
A mealy machine

Q. Which of the following does not belong to input alphabet if S={a, b}* for any language?

Q. The number of final states we need as per the given language?
Language L: {a^n| n is even or divisible by 3}

Q. State true or false:
Statement: Both NFA and e-NFA recognize exactly the same languages.

Q. Design a NFA for the language:
L: {an| n is even or divisible by 3}

Which of the following methods can be used to simulate the same.

Q. Which of the following not an example Bounded Information?

Q. A Language for which no DFA exist is a________

Q. A DFA cannot be represented in the following format

Q. When are 2 finite states equivalent?

Q. Can a DFA recognize a palindrome number?

Q. Which of the following is not an example of finite state machine system?

Q. The password to the admins account=”administrator”. The total number of states required to make a password-pass system using DFA would be __________

Q. Let ∑= {a, b, …. z} and A = {Hello, World}, B= {Input, Output}, then (A*∩B) U (B*∩A) can be represented as:

Q. For a machine to surpass all the letters of alphabet excluding vowels, how many number of states in DFA would be required?

Q. Given L= {Xϵ∑*= {a, b} |x has equal number of a, s and b’s}.
Which of the following property satisfy the regularity of the given language?