gs gs101 Undecidability - The Universal Language-Undecidability - Quiz No.2
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 4 multiple choice questions (MCQs) to prepare and belongs to topic Undecidability. 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: A formal language is recursive if :
a total turing machine exists
a turing machine that halts for every input
turing machine rejects if the input does not belong to the language
all of the mentioned
Question 2: Recursive languages are also known as:
decidable
undecidable
sometimes decidable
none of the mentioned
Question 3: The class of recursive language is known as:
R
RC
RL
All of the mentioned
Question 4: Which of the following was not a part of Chomsky hierarchy?
Context sensitive grammar
Unrestricted grammar
Recursive grammar
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
