adplus-dvertising
frame-decoration

Question

Equivalence of automata states that ____________

a.

two automata accept the same set of input strings

b.

two automata have same set of states

c.

two automata does not contain initial input symbols

d.

two automata share equal transition function

Posted under Discrete Mathematics

Answer: (a).two automata accept the same set of input strings

Engage with the Community - Add Your Comment

Confused About the Answer? Ask for Details Here.

Know the Explanation? Add it Here.

Q. Equivalence of automata states that ____________

Similar Questions

Discover Related MCQs

Q. Which of the following techniques refer to the equivalence of DFA and N-DFA automata?

Q. A deterministic automaton system can have ______ transition for a given state of an input symbol.

Q. Optimisation of an FSM machine can be done by ________

Q. In system engineering which of the following methods bridges the gap between the two ends of system development?

Q. Which of the following is not a member of the set of a deterministic finite state machine?

Q. Which of the following algorithms transforms any NFA into its identical DFA?

Q. How many states are there in combinatorial FSM?

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?

Q. How many false essential prime implicants for the given Boolean functions f(A, B, C) = ∑m(2, 5, 6)?

Q. For an 18-variable k-map determine the number of prime implicants?

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)

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)?

Q. f(x, y, z) = xy’+yz’+xyz, what are essential prime implicants of this switching function?

Q. How many number of prime implicants are there in the expression F(x, y, z) = y’z’ + xy + x’z.

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.

Q. How many cells are there for an 8-variable K-Map?

Q. What is the maximum number of prime implicants with 34-variable minimized expression?

Q. Which of the following gates is used to implement a logical conditional?

Q. Which of the following is built exclusively from NOR gate?

Q. In OR gate for 13 numbers of inputs what are the stages possible for it?