Test: Equivalence of NFA & DFA


10 Questions MCQ Test Theory of Computation | Test: Equivalence of NFA & DFA


Description
This mock test of Test: Equivalence of NFA & 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: Equivalence of NFA & DFA (mcq) to study with solutions a complete question bank. The solved questions answers in this Test: Equivalence of NFA & DFA quiz give you a good mix of easy questions and tough questions. Computer Science Engineering (CSE) students definitely take this Test: Equivalence of NFA & DFA exercise for a better result in the exam. You can find other Test: Equivalence of NFA & DFA extra questions, long questions & short questions for Computer Science Engineering (CSE) on EduRev as well by searching above.
QUESTION: 1

Under which of the following operation, NFA is not closed?

Solution:

: NFA is said to be closed under the following operations:
a) Union
b) Intersection
c) Concatenation
d) Kleene
e) Negation

QUESTION: 2

 It is less complex to prove the closure properties over regular languages using

Solution:

 We use the construction method to prove the validity of closure properties of regular languages. Thus, it can be observe, how tedious and complex is the construction of a DFA as compared to an NFA with respect to space.

QUESTION: 3

Which of the following is an application of Finite Automaton?

Solution:

There are many applications of finite automata, mainly in the field of Compiler Design and Parsers and Search Engines.

QUESTION: 4

John is asked to make an automaton which accepts a given string for all the occurrence of ‘1001’ in it. How many number of transitions would John use such that, the string processing application works?

Solution:

QUESTION: 5

Which of the following do we use to form an NFA from a regular expression?

Solution:

Thompson Construction method is used to turn a regular expression in an NFA by fragmenting the given regular expression through the operations performed on the input alphabets.

QUESTION: 6

Which among the following can be an example of application of finite state machine(FSM)?

Solution:

Idle is the state when data in form of packets is send and returns if NAK is received else waits for the NAK to be received.

QUESTION: 7

Which among the following is not an application of FSM?

Solution:

Finite state automation is used in Lexical Analyser, Computer BOT (used in games), State charts, etc.

QUESTION: 8

 L1= {w | w does not contain the string tr }
L2= {w | w does contain the string tr}
Given ∑= {t, r}, The difference of the minimum number of states required to form L1 and L2?

Solution:

QUESTION: 9

Predict the number of transitions required to automate the following language using only 3 states:L= {w | w ends with 00}

Solution:

QUESTION: 10

 The total number of states to build the given language using DFA:L= {w | w has exactly 2 a’s and at least 2 b’s}

Solution:


Explanation: We need to make the number of a as fixed i.e. 2 and b can be 2 or more. Thus, using this condition a finite automata can be created using 1 states.

Related tests