Bissoy.com
Doctors Medicines MCQs Q&A

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?

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? Correct Answer <img alt="F1 Raju Shraddha 01.06.2021 D 18" src="//storage.googleapis.com/tb-img/production/21/06/F1_Raju_Shraddha_01.06.2021_D%2018.png" style="width: 209px; height: 160px;">

Related Questions

For realizing a binary half-subtractor having two inputs A and B, the current set of logical expression for the outputs D (A minus B) and X (borrow) are 1. The difference output D = A̅B + AB̅ 2. The borrow output B = AB̅ Which of the above statements is/are correct? 
For every NFA a deterministic finite automaton (DFA) can be found that accepts the same language.
A signal is said to be 1. Deterministic if there is no uncertainty over the signal at any instant of time. 2. Deterministic if it is expressible through a mathematical equation. 3. Random or non-deterministic if there is uncertainty over the signal at the instant of time. 4. Random or non-deterministic if it is not expressible through a mathematical equation. Which of the above statements are correct?
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.
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? 
Given an arbitrary non-deterministic finite automaton (NFA) with N states, the maximum number of states in an equivalent minimized DFA is at least?
Let w be any string of length n in {0, 1}*. Let L be the set of all substrings of w. What is the minimum number of states in a non-deterministic finite automaton that accepts L?
Study the information carefully and answer the questions given below: If we arrange the alphabets in the word "RATE" in the English alphabetical order, word "AERT" is formed. Then the third alphabet from the left in this word is "R". similarly, from the word "OPEN" we get - "ENOP" and the third alphabet from the left is "O". From the word "CHEF" we get - "CEFH" the third alphabet from the left "F". From the word "TOY" we get - "OTY" and the third alphabet from the left is "Y". From the word "EAT" we get - "AET" and the third alphabet from the left is "T" If we use all these letters, then a meaningful English word "FORTY" can be formed. Now find which of the following word set DOES NOT give a meaningful word in a similar way.
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
How many states are there in a minimum state deterministic finite automaton accepting the language L = {w | ∈ (0,1)*, number of 0's is divisible by 2, and number of 1's is divisible by 5, respectively}?