gs gs101 Introduction to Turing Machines - Turing Machine and Halting - Quiz No.1
gs gs101 Automata Theory Quiz
This quiz belongs to book/course code gs gs101 Automata Theory of gs organization. We have 92 quizzes available related to the book/course Automata Theory. This quiz has a total of 10 multiple choice questions (MCQs) to prepare and belongs to topic Introduction to Turing Machines. NVAEducation wants its users to help them learn in an easy way. For that purpose, you are free to prepare online MCQs and quizzes.
NVAEducation also facilitates users to contribute in online competitions with other students to make a challenging situation to learn in a creative way. You can create one to one, and group competition on an topic of a book/course code. Also on NVAEducation you can get certifications by passing the online quiz test.
Question 1: Which of the following regular expression resembles the given diagram?
{a}*{b}*{a,b}
{a,b}*{aba}
{a,b}*{bab}
{a,b}*{a}*{b}*
Question 4: The machine accept the string by entering into hA or it can:
enter into accept halting state
enter into reject halting state
goes into loop forever
None of the mentioned
Question 5: d(q,X)=(r,Y,D) where D cannot be:
L
R
S
None of the mentioned
Question 6: Which of the following can accept even palindrome over {a,b}
Push down Automata
Turing machine
NDFA
All of the mentioned
Question 7: Which of the functions can a turing machine not perform?
Copying a string
Deleting a symbol
Accepting a pal
Inserting a symbol
Question 8: If T1 and T2 are two turing machines. The composite can be represented using the expression:
T1T2
T1 U T2
T1 X T2
None of the mentioned
Question 9: The following turing machine acts like:
Copies a string
Delete a symbol
Insert a symbol
None of the mentioned
Question 10: What does the following transition graph shows:
Copies a symbol
Reverses a string
Accepts a pal
None of the mentioned
Online Quizzes of gs101 Automata Theory
Other Classes Of Problems - Randomized Algorithm - Quiz No.1
gs gs101
Automata Theory Online Quizzes
Push Down Automata - DPDA and Ambiguous Grammars - Quiz No.1
gs gs101
Automata Theory Online Quizzes
