Bissoy.com
Doctors Medicines MCQs Q&A

Related Questions

Ndfa and dfa accept same languages.
Can a DFA simulate NDFA?
Consider the set of strings on {0,1} in which, every substring of 3 symbols has at most two zeros. For example, 001110 and 011001 are in the language, but 100010 is not. All strings of length less than 3 are also in the language. A partially completed DFA that accepts this language is shown below. The missing arcs in the DFA are
Which of the following techniques refer to the equivalence of DFA and N-DFA automata?
Consider the DFA A given below Which of the following are FALSE? 1. Complement of L(A) is context-free. 2. L(A) = L((11*0 + 0)(0 + 1)*0*1*) 3. For the language accepted by A, A is the minimal DFA. 4. A accepts all strings over {0, 1} of length at least 2.
A deterministic finite automaton (DFA) D with alphabet ∑ = {a,b} is given below. Which of the following finite state machines is a valid minimal DFA which accepts the same language as D?
Let L ⊆ {0,1}* be an arbitrary regular language accepted by a minimal DFA with k states. Which one of the following languages must necessarily be accepted by a minimal DFA with k states? 
Let the given DFA consist of x states. Find x-y such that y is the number of states on minimization of DFA?
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.
If NFA of 6 states excluding the initial state is converted into DFA, maximum possible number of states for the DFA is ?