Question
a.
DFA
b.
NDFA
c.
NFA
d.
Turing machine
Posted under Discrete Mathematics
Engage with the Community - Add Your Comment
Confused About the Answer? Ask for Details Here.
Know the Explanation? Add it Here.
Q. In lexical analysis of a compiler______ is used.
Similar Questions
Discover Related MCQs
Q. In the operating system, newly started processes can have a start in the _________
View solution
Q. Equivalence of automata states that ____________
View solution
Q. Which of the following techniques refer to the equivalence of DFA and N-DFA automata?
View solution
Q. A deterministic automaton system can have ______ transition for a given state of an input symbol.
View solution
Q. Optimisation of an FSM machine can be done by ________
View solution
Q. In system engineering which of the following methods bridges the gap between the two ends of system development?
View solution
Q. Which of the following is not a member of the set of a deterministic finite state machine?
View solution
Q. Which of the following algorithms transforms any NFA into its identical DFA?
View solution
Q. How many states are there in combinatorial FSM?
View solution
Q. How many minimal forms are there in the function F(A, B, C) = ∑(1, 3, 2, 5, 6, 7) if it is having cyclic prime implicants k-map?
View solution
Q. How many false essential prime implicants for the given Boolean functions f(A, B, C) = ∑m(2, 5, 6)?
View solution
Q. For an 18-variable k-map determine the number of prime implicants?
View solution
Q. Determine the number of prime implicants of the following function F?
F(a, b, c, d) = Σm(1, 3, 7, 9, 10, 11, 13, 15)
View solution
Q. How many essential prime implicants are there in the K-Map of the function F = Σ(0, 1, 2, 4, 7, 11, 12, 13, 15)?
View solution
Q. f(x, y, z) = xy’+yz’+xyz, what are essential prime implicants of this switching function?
View solution
Q. How many number of prime implicants are there in the expression F(x, y, z) = y’z’ + xy + x’z.
View solution
Q. Determine the number of essential prime implicants of the function f(a, b, c, d) = Σm(1, 3, 4, 8, 10, 13) + d(2, 5, 7, 12), where m denote the minterm and d denotes the don’t care condition.
View solution
Q. How many cells are there for an 8-variable K-Map?
View solution
Q. What is the maximum number of prime implicants with 34-variable minimized expression?
View solution
Q. Which of the following gates is used to implement a logical conditional?
View solution
Suggested Topics
Are you eager to expand your knowledge beyond Discrete Mathematics? 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!