Question
a.
State
b.
Previous State
c.
State and Input
d.
Only Input
Posted under Formal Languages and Automata Theory
Engage with the Community - Add Your Comment
Confused About the Answer? Ask for Details Here.
Know the Explanation? Add it Here.
Q. In mealy machine, the O/P depends upon?
Similar Questions
Discover Related MCQs
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
Q. Can a DFA recognize a palindrome number?
View solution
Q. Which of the following is not an example of finite state machine system?
View solution
Q. The password to the admins account=”administrator”. The total number of states required to make a password-pass system using DFA would be __________
View solution
Q. Let ∑= {a, b, …. z} and A = {Hello, World}, B= {Input, Output}, then (A*∩B) U (B*∩A) can be represented as:
View solution
Q. For a machine to surpass all the letters of alphabet excluding vowels, how many number of states in DFA would be required?
View solution
Suggested Topics
Are you eager to expand your knowledge beyond Formal Languages and Automata Theory? We've curated a selection of related categories that you might find intriguing.
Click on the categories below to discover a wealth of MCQs and enrich your understanding of Computer Science. Happy exploring!