Turing Machine-Notation and Transition Diagrams Online Exam Quiz
Turing Machine-Notation and Transition Diagrams GK Quiz. Question and Answers related to Turing Machine-Notation and Transition Diagrams. MCQ (Multiple Choice Questions with answers about Turing Machine-Notation and Transition Diagrams
All the regular languages can have one or more of the following descriptions:^ i) DFA ii) NFA iii) e-NFA iv) Regular Expressions^ Which of the following are correct?
Options
A : i, ii, iv
B : i, ii, iii
C : i, iv
D : i, ii, iii, iv
Fill in the blank with the most appropriate option.^ Statement: In theory of computation, abstract machines are often used in ___ regarding computability or to analyze the complexity of an algorithm.
Options
A : thought experiments
B : principle
C : hypothesis
D : all of the mentioned
If L is DFA-regular, L' is
Options
A : Non regular
B : DFA-regular
C : Non-finite
D : None of the mentioned
State true or false:^ Statement: RAM model allows random access to indexed memory locations.
Options
A : TRUE
B : FALSE
C : -
D : -
The ability for a system of instructions to simulate a Turing Machine is called ___
Options
A : Turing Completeness
B : Simulation
C : Turing Halting
D : None of the mentioned
Turing machine can be represented using the following tools:
Options
A : Transition graph
B : Transition table
C : Queue and Input tape
D : All of the mentioned
Which of the following are non regular?
Options
A : The set of strings in {a,b}* with an even number of b's
B : The set of strings in {a, b, c}* where there is no c anywhere to the left of a
C : The set of strings in {0, 1}* that encode, in binary, an integer w that is a multiple of 3. Interpret the empty strings e as the number 0.
D : None of the mentioned
Which of the following is false for an abstract machine?
Options
A : Turing machine
B : theoretical model of computer
C : assumes a discrete time paradigm
D : all of the mentioned
Which of the following language regular?
Options
A : {aibi|i>=0}
B : {aibi|0<i<5}
C : {aibi|i>=1}
D : None of the mentioned
Which of the technique can be used to prove that a language is non regular?
Options
A : Ardens theorem
B : Pumping Lemma
C : Ogden's Lemma
D : None of the mentioned
Ambiguous Grammar more Online Exam Quiz
From Grammars to Push Down Automata
Node-Cover Problem, Hamilton Circuit Problem
Problem Solvable in Polynomial Time
Properties-Non Regular Languages
Regular Language & Expression - 1
Engine Components - Connecting Rod