Question
a.
There exists a unique DFA for every regular language
b.
NFA can always are converted to a PDA
c.
Complement of CFL is always recursive
d.
Every NDFA can be converted to a DFA
Posted under Formal Languages and Automata Theory
Engage with the Community - Add Your Comment
Confused About the Answer? Ask for Details Here.
Know the Explanation? Add it Here.
Q. Which one is a FALSE statement?
Similar Questions
Discover Related MCQs
Q. Examine the following DFA: If input is 011100101, which edge is NOT traversed?
View solution
Q. If string s is accepted by this DFA, which of these strings cannot be suffix of s?
View solution
Q. The classes of languages P and NP are closed under certain operations, and not closed under others. Decide whether P and NP are closed under each of the following operations.
1. Union
2. Intersection
3. Intersection with a regular language
4. Kleene closure (star)
5. Homomorphism
6. Inverse homomorphism
View solution
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
Suggested Topics
Are you eager to expand your knowledge beyond Formal Languages and Automata Theory? We've curated a selection of related categories that you might find intriguing.
Click on the categories below to discover a wealth of MCQs and enrich your understanding of Computer Science. Happy exploring!
