0 of 20 questions completed
Questions:
 1
 2
 3
 4
 5
 6
 7
 8
 9
 10
 11
 12
 13
 14
 15
 16
 17
 18
 19
 20
Information
Test Description :
Name: Theory of automata and computation question papers – 2
Subject: Automata and computation theory
Questions: 20 Objective Type
Time Allowed: 15 Minutes
Important for: Computer Science Students of B. Tech / M. Tech / B. Sc. / M. Sc. for GATE, PSUs and job interviews.
You have already completed the Test before. Hence you can not start it again.
Test is loading...
You must sign in or sign up to start the Test.
You have to finish following quiz, to start this Test:
Congratulations!!!" Theory of automata and computation question papers  2 "
0 of 20 questions answered correctly
Your time:
Time has elapsed
Your Final Score is : 0
You have attempted : 0
Number of Correct Questions : 0 and scored 0
Number of Incorrect Questions : 0 and Negative marks 0
Average score  
Your score 

Not categorized
You have attempted: 0
Number of Correct Questions: 0 and scored 0
Number of Incorrect Questions: 0 and Negative marks 0
It’s time to share this quiz with your friends on Facebook, Twitter, Google Plus, Whatsapp or LinkedIn…
Click on View Questions Button to check Correct and incorrect answers.
Also Attempt: Automata and computation theory – 1
 1
 2
 3
 4
 5
 6
 7
 8
 9
 10
 11
 12
 13
 14
 15
 16
 17
 18
 19
 20
 Answered
 Review
 Question 1 of 20
1. Question
1 pointsWhich one of the following statement is correct about computational machine?
CorrectIncorrectUnattempted  Question 2 of 20
2. Question
1 pointsWhat is the major difference in between a Moore and a Mealy machine?
CorrectIncorrectUnattempted  Question 3 of 20
3. Question
1 pointsWhich one of the following statement is correct about computational machine?
CorrectIncorrectUnattempted  Question 4 of 20
4. Question
1 pointsWhat will be the recognizing capability of NDFSM and DFSM?
CorrectDFSM is a special case of NDFSM. Corresponding to any given NDFSM, one can construct an equivalent DFSM. Corresponding to any given DFSM, one can construct an equivalent NDFSM. So they are equally powerful.
IncorrectDFSM is a special case of NDFSM. Corresponding to any given NDFSM, one can construct an equivalent DFSM. Corresponding to any given DFSM, one can construct an equivalent NDFSM. So they are equally powerful.
UnattemptedDFSM is a special case of NDFSM. Corresponding to any given NDFSM, one can construct an equivalent DFSM. Corresponding to any given DFSM, one can construct an equivalent NDFSM. So they are equally powerful.
 Question 5 of 20
5. Question
1 pointsHow can a Finite State Machine (FSM) is recognize
CorrectIncorrectUnattempted  Question 6 of 20
6. Question
1 pointsWhat is the main importance of Pumping lemma or what type of grammar proved by using Pumping lemma
CorrectIncorrectUnattempted  Question 7 of 20
7. Question
1 pointsWhich of the following are not regular?
CorrectStrings of odd number of zeroes can be generated by the regular expression (00)*0. Pumping lemma can be used to prove the nonregularity of the other options.
IncorrectStrings of odd number of zeroes can be generated by the regular expression (00)*0. Pumping lemma can be used to prove the nonregularity of the other options.
UnattemptedStrings of odd number of zeroes can be generated by the regular expression (00)*0. Pumping lemma can be used to prove the nonregularity of the other options.
 Question 8 of 20
8. Question
1 pointsWhich of the following pairs of regular expressions are equivalent?
CorrectTwo regular expressions R1 and R2 are equivalent if any string that can be generated by R1 can be generated by R2 and viceversa. In option (3), (ab)* will generate abab, which is not of the form a^{n}b^{n} (because a’s and b’s should come together). All other options are correct.
IncorrectTwo regular expressions R1 and R2 are equivalent if any string that can be generated by R1 can be generated by R2 and viceversa. In option (3), (ab)* will generate abab, which is not of the form a^{n}b^{n} (because a’s and b’s should come together). All other options are correct.
UnattemptedTwo regular expressions R1 and R2 are equivalent if any string that can be generated by R1 can be generated by R2 and viceversa. In option (3), (ab)* will generate abab, which is not of the form a^{n}b^{n} (because a’s and b’s should come together). All other options are correct.
 Question 9 of 20
9. Question
1 pointsIdentify which of the following statement is incorrect statement:
CorrectIncorrectUnattempted  Question 10 of 20
10. Question
1 pointsIn Context Free Grammar (CFG) the Left hand side of a production consists
CorrectIncorrectUnattempted  Question 11 of 20
11. Question
1 pointsIn a Finite Automata (FA), if one enters in a specific state and there is no way to leave that state, then that type of specific state is known as
CorrectIncorrectUnattempted  Question 12 of 20
12. Question
1 pointsWhat is the main reason behind the powerfulness of Turing Machine (TM) than Finite State Machine (FSM)?
CorrectIncorrectUnattempted  Question 13 of 20
13. Question
1 pointsConsider the following state diagram
What is its Regular expression?
CorrectIncorrectUnattempted  Question 14 of 20
14. Question
1 pointsWhich of the following option is correct if we stated that, “Every regular expression can be expressed as CFG but every CFG cannot be expressed as a regular expression”?
CorrectIncorrectUnattempted  Question 15 of 20
15. Question
1 pointsWho did the inventor of Turing machine?
CorrectIncorrectUnattempted  Question 16 of 20
16. Question
1 pointsAccording to Kleene’s theorem states which of the following statement is true ?
CorrectIncorrectUnattempted  Question 17 of 20
17. Question
1 pointsIn the grammar what will be the grammatical rules called_________.
CorrectIncorrectUnattempted  Question 18 of 20
18. Question
1 pointsThe meaning of words are known as ________, but this is not involved in grammatical rules.
CorrectIncorrectUnattempted  Question 19 of 20
19. Question
1 pointsIn the pumping lemma theorem (xy^{n}z) what is the range of n.
CorrectIncorrectUnattempted  Question 20 of 20
20. Question
1 pointsWhich of the following statement is explain about the Myhill Nerode theorem?
CorrectIncorrectUnattempted