adplus-dvertising
frame-decoration

Question

How many DFA’s exits with two states over input alphabet {0,1} ?

a.

16

b.

26

c.

32

d.

64

Answer: (d).64

Engage with the Community - Add Your Comment

Confused About the Answer? Ask for Details Here.

Know the Explanation? Add it Here.

Q. How many DFA’s exits with two states over input alphabet {0,1} ?

Similar Questions

Discover Related MCQs

Q. The basic limitation of finite automata is that

Q. Number of states require to simulate a computer with memory capable of storing ‘3’ words each of length ‘8’.

Q. FSM with output capability can be used to add two given integer in binary representation. This is

Q. Which of the following options is correct?
Statement 1: Initial State of NFA is Initial State of DFA.

Statement 2: The final state of DFA will be every combination of final state of NFA.

Q. Given Language: L= {ab U aba}*
If X is the minimum number of states for a DFA and Y is the number of states to construct the NFA,

|X-Y|=?

Q. An automaton that presents output based on previous state or current input:

Q. If NFA of 6 states excluding the initial state is converted into DFA, maximum possible number of states for the DFA is ?

Q. NFA, in its name has ’non-deterministic’ because of :

Q. Which of the following is correct proposition?
Statement 1: Non determinism is a generalization of Determinism.

Statement 2: Every DFA is automatically an NFA

Q. Given Language L= {xϵ {a, b}*|x contains aba as its substring}
Find the difference of transitions made in constructing a DFA and an equivalent NFA?

Q. The construction time for DFA from an equivalent NFA (m number of node)is:

Q. If n is the length of Input string and m is the number of nodes, the running time of DFA is x that of NFA.Find x?

Q. Which of the following option is correct?

Q. The number of tuples in an extended Non Deterministic Finite Automaton:

Q. What is wrong in the given definition?
Def: ({q0, q1, q2}, {0,1}, δ, q3, {q3})

Q. If δ is the transition function for a given NFA, then we define the δ’ for the DFA accepting the same language would be:
Note: S is a subset of Q and a is a symbol.

Q. What is the relation between DFA and NFA on the basis of computational power?

Q. If a string S is accepted by a finite state automaton, S=s1s2s3……sn where siϵ∑ and there exists a sequence of states r0, r1, r2…… rn such that δ(r(i), si+1) =ri+1 for each 0, 1, …n-1, then r(n) is:

Q. Subset Construction method refers to:

Q. Given Language:
Ln= {xϵ {0,1} * | |x|≥n, nth symbol from the right in x is 1}

How many state are required to execute L3 using NFA?