Automata Theory The Diagonalization Languages Online Exam Quiz
Automata Theory The Diagonalization Languages GK Quiz. Question and Answers related to Automata Theory The Diagonalization Languages. MCQ (Multiple Choice Questions with answers about Automata Theory The Diagonalization Languages
With reference ti enumeration of binary strings, the conversion of binary strings to integer is possible by treating the resulting string as a base ____ integer.
Options
A : 2
B : 8
C : 16
D : All of the mentioned
Which of the following are decidable problems?
Options
A : Can a particular line of code in a program ever be executed?
B : Do two given CFG’s generate the same language
C : Is a given CFG ambiguous?
D : None of the mentioned
If a problem has an algorithm to answer it, we call it _________
Options
A : decidable
B : solved
C : recognizable
D : none of the mentioned
Which of the following are undecidable problems?
Options
A : Determining whether two grammars generate the same language
B : Determining whether a grammar is ambiguous
C : Both (a) and (b)
D : None of the mentioned
Which of the following technique is used to find whether a natural language isnt recursive ennumerable?
Options
A : Diagonalization
B : Recursive Induction
C : Both (a) and (b)
D : None of the mentioned
Which of the following are incorrect options?
Options
A : Informally, problem is a yes/no question about an infinite set of possible instances
B : Formally, a problem is a language
C : Both (a) and (b)
D : None of the mentioned
Which of the following is true for The Halting problem?
Options
A : It is recursively ennumerable
B : It is undecidable
C : Both (a) and (b)
D : None of the mentioned
Which of the following are correct statements?
Options
A : TMs that always halt are known as Decidable problems
B : TMs that are guaranteed to halt only on acceptance are recursive ennumerable.
C : Both (a) and (b)
D : None of the mentioned
Diagonalization can be useful in:
Options
A : To find a non recursively ennumerable language
B : To prove undecidablility of haltig problem
C : Both (a) and (b)
D : None of the mentioned
Statement: If L id R.E., Lc needs to be R.E. Is it correct?
Options
A : Yes
B : No
C : Maybe
D : Cannot predict
Chemical Engineering Basics - Part 1 more Online Exam Quiz
Automata Theory Sentential Forms
Automata Theory Simpler Notations
Automata Theory Simulation Turing Machine
Automata Theory Testing Emptiness Membership
Automata Theory The Language Dfa
Automata Theory The Language Nfa
Automata Theory The Language Turing Machine