Q. L1 is accepted by the NFA, obtained by changing the accepting state of M to a non-accepting state and vice versa. Which of the following statements is true?

View solution

Q. The number of states in DFA that accepts the language L(M) ∩ L(N) is ________.

View solution

Q. The reorganizing capability of NDFA and DFA

View solution

Q. Which of the following statement is true?

View solution

Q. Grammars that can be translated to DFAs :

View solution

Q. A language is regular if and only if it is accepted by finite automata

View solution

Q. A Push Down Automata _______________ is if there is at most one transition applicable to each configuration?

View solution

Q. The following mealy machine outputs which of the following?

View solution

Q. Which of the following does the given Mealy machine represents?

View solution

Q. Which of the following belongs to the epsilon closure set of a?

View solution

Q. The number of elements present in the e-closure(f2) in the given diagram:

View solution

Q. Which of the steps are non useful while eliminating the e-transitions for the given diagram?

View solution

Q. Remove all the epsilon transitions in the given diagram and compute the number of a-transitions in the result?

View solution

Q. What the following DFA accepts?

View solution

Q. What does the following figure most correctly represents?

View solution

Q. Which of the following will not be accepted by the following DFA?

View solution

Q. Which of the following will the given DFA won’t accept?

View solution

Q. Which of the following is the corresponding Language to the given DFA?

View solution

Q. Let the given DFA consist of x states. Find x-y such that y is the number of states on minimization of DFA?

View solution

Q. For the DFA given below compute the following:
Union of all possible combinations at state 7,8 and 9.

View solution