Test: Applications of DFA

10 Questions MCQ Test Theory of Computation | Test: Applications of DFA

This mock test of Test: Applications of DFA for Computer Science Engineering (CSE) helps you for every Computer Science Engineering (CSE) entrance exam. This contains 10 Multiple Choice Questions for Computer Science Engineering (CSE) Test: Applications of DFA (mcq) to study with solutions a complete question bank. The solved questions answers in this Test: Applications of DFA quiz give you a good mix of easy questions and tough questions. Computer Science Engineering (CSE) students definitely take this Test: Applications of DFA exercise for a better result in the exam. You can find other Test: Applications of DFA extra questions, long questions & short questions for Computer Science Engineering (CSE) on EduRev as well by searching above.

Given Language: {x | it is divisible by 3}
The total number of final states to be assumed in order to pass the number constituting {0, 1} is


The DFA for the given language can be constructed as follows:


 A binary string is divisible by 4 if and only if it ends with:


 If the string is divisible by four, it surely ends with the substring ‘100’ while a binary string divisible by 2 would surely end with the substring ‘10’.


Let L be a language whose FA consist of 5 acceptance states and 11 non final states. It further consists of a dumping state. Predict the number of acceptance states in Lc.


If L leads to FA1, then for Lc, the FA can be obtained by exchanging the final and non-final states.


 If L1 and L2 are regular languages, which among the following is an exception?


It the closure property of Regular language which lays down the following statement:
If L1, L2 are 2- regular languages, then L1 U L2, L1 ∩ L2, L1C, L1 – L2 are regular language.


Predict the analogous operation for the given language:
A: {[p, q] | p ϵ A1, q does not belong to A2}


When set operation ‘-‘ is performed between two sets, it points to those values of prior set which belongs to it but not to the latter set analogous to basic subtraction operation.


Which among the following NFA’s is correct corresponding to the given Language?
L= {xϵ {0, 1} | 3rd bit from right is 0}


The NFA accepts all binary strings such that the third bit from right end is 1 and if not, is send to Dumping state. Note: It is assumed that the input is given from the right end bit by bit.


 Statement 1: NFA computes the string along parallel paths.Statement 2: An input can be accepted at more than one place in an NFA.Which among the following options are most appropriate?


While the machine runs on some input string, if it has the choice to split, it goes in all possible way and each one is different copy of the machine. The machine takes subsequent choice to split further giving rise to more copies of the machine getting each copy run parallel. If any one copy of the machine accepts the strings, then NFA accepts, otherwise it rejects.


Which of the following options is correct for the given statement?
Statement: If K is the number of states in NFA, the DFA simulating the same language would have states less than 2k.


 If K is the number of states in NFA, the DFA simulating the same language would have states equal to or less than 2k.


Let N (Q, ∑, δ, q0, A) be the NFA recognizing a language L. Then for a DFA (Q’, ∑, δ’, q0’, A’), which among the following is true?


All the optioned mentioned are the instruction formats of how to convert a NFA to a DFA.


There exists an initial state, 17 transition states, 7 final states and one dumping state, Predict the maximum number of states in its equivalent DFA?


The maximum number of states an equivalent DFA can comprise for its respective NFA with k states will be 2k.

Similar Content

Related tests