Q. The total number of states and transitions required to form a moore machine that will produce residue mod 3.

View solution

Q. 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)

View solution

Q. The output alphabet can be represented as:

View solution

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

View solution

Q. In mealy machine, the O/P depends upon?

View solution

Q. Which of the given are correct?

View solution

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

View solution

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

View solution

Q. Mealy and Moore machine can be categorized as:

View solution

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

View solution

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

Choose the correct option:

View solution

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

View solution

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

View solution

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

View solution

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

View solution

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.

View solution

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

View solution

Q. A Language for which no DFA exist is a________

View solution

Q. A DFA cannot be represented in the following format

View solution

Q. When are 2 finite states equivalent?

View solution