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
Quiz Description :
Name : Automata and computation theory question answers test
Subject : Automata and computation theory
Questions: 20 Objective type
Time Allowed : 20 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!!!" Automata and computation theory question answers test "
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.
 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 pointsFrom the following which statement is current about tape of Turing machine?
CorrectIncorrectUnattempted  Question 2 of 20
2. Question
1 pointsThe production of the form nonterminal →one nonterminal is known as
CorrectIncorrectUnattempted  Question 3 of 20
3. Question
1 pointsFor a given input, which of the following provides the compliment of the Boolean AND output
CorrectIncorrectUnattempted  Question 4 of 20
4. Question
1 pointsWhich one of the following is correct for a computational machine?
CorrectIncorrectUnattempted  Question 5 of 20
5. Question
1 pointsLet M and N be regular expressed by ab*a and (ba)* respectively i.e M={aa ,aba ,abba ……}and N={Λ, bababa, bababa…….}..aba is the only word in M which can make a word in N, because the words in N don’t contain the
CorrectIncorrectUnattempted  Question 6 of 20
6. Question
1 pointsWhich one of the following is responsible of delays the transmission of signal along the wire by one step (clock pulse).
CorrectIncorrectUnattempted  Question 7 of 20
7. Question
1 pointsIn a computation process to describe the complement of a language, it is necessary to describe the ______ of that language over which the language is defined.
CorrectIncorrectUnattempted  Question 8 of 20
8. Question
1 pointsAssume that L is a language defined over an alphabet ∑, then the language of strings, defined over ∑, not belonging to L denoted by L^{C} or L. is called:
CorrectIncorrectUnattempted  Question 9 of 20
9. Question
1 pointsWhich of the following provides the Boolean OR output for the given input?
CorrectIncorrectUnattempted  Question 10 of 20
10. Question
1 pointsLet a regular language is L then as per the Kleene theorem there exists an
CorrectIncorrectUnattempted  Question 11 of 20
11. Question
1 pointsIf r_{1}= (aa + bb) and r_{2} = (a + b) are two regular expression then the language (aa + bb)(a + b) will be generated by
CorrectIncorrectUnattempted  Question 12 of 20
12. Question
1 pointsIf L_{1} and L_{2} are two regular languages then following expression is/are also regular language(s).
(P) L_{1} + L_{2} (Q) L_{1}L_{2} (R) L_{1}*
CorrectIncorrectUnattempted  Question 13 of 20
13. Question
1 pointsIf L represents a regular language then, L^{C} is also represents a _____ language.
CorrectIncorrectUnattempted  Question 14 of 20
14. Question
1 pointsWhen an effectively solvable problem has answered only yes or no, then what its solution called ______.
CorrectIncorrectUnattempted  Question 15 of 20
15. Question
1 pointsThere is an approach in defining the quotient of regular languages i.e. the language M is said to be quotient of two regular languages N and O, denoted by M=O/N if :
CorrectIncorrectUnattempted  Question 16 of 20
16. Question
1 pointsLet L be a language defined over an alphabet ∑ if two strings x and y defined over ∑ are run over an FA accepting the language L, then x and y are said to belong to the same ____ if they end in the same ___.
CorrectIncorrectUnattempted  Question 17 of 20
17. Question
1 pointsIf L represents a regular language then, ____ is also represents a regular language.
CorrectIncorrectUnattempted  Question 18 of 20
18. Question
1 pointsConverting each of the final states of F to nonfinal states and old nonfinal states of F to final states, Finite automata thus obtained will reject every string belonging to L and will accept every string, defined over Σ, not belonging to L. is known as
CorrectIncorrectUnattempted  Question 19 of 20
19. Question
1 pointsIn formal languages what is meant by the word ‘Formal’
CorrectIncorrectUnattempted  Question 20 of 20
20. Question
1 pointsLet A = {0, 1}. The number of possible strings of length ‘n’ that can be formed by the elements of the set A is
CorrectIncorrectUnattempted