Automata Theory Freshers Online Exam Quiz
Automata Theory Freshers GK Quiz. Question and Answers related to Automata Theory Freshers. MCQ (Multiple Choice Questions with answers about Automata Theory Freshers
Which of the following statements are false?
Options
A : Every recursive language is recursively ennumerable
B : Recursively ennumerable language may not be recursive
C : Recursive languages may not be recursively ennumerable
D : None of the mentioned
A Language L may not be accepted by a Turing Machine if:
Options
A : It it is recursively ennumerable
B : It is recursive
C : L can be ennumerated by some turing machine
D : None of the mentioned
A recursively ennumerable language L can be recursive if:
Options
A : L’ is recursively ennumerable
B : Every possible sequence of moves of T, the TM which accept L, causes it to halt
C : Both (a) and (b)
D : None of the mentioned
If L is a recursive language, L’ is:
Options
A : Recursive
B : Recursively Ennumerable
C : Both (a) and (b)
D : None of the mentioned
A language L is said to be Turing decidable if:
Options
A : recursive
B : TM recognizes L
C : TM accepts L
D : None of the mentioned
The class of recursively ennumerable language is known as:
Options
A : Turing Class
B : Recursive Languages
C : Universal Languages
D : RE
Chemical Engineering Basics - Part 1 more Online Exam Quiz
Automata Theory Equivalence Nfa Dfa
Automata Theory Equivalence One Tape Multitape Turing Machine
Automata Theory Extended Transition Function
Automata Theory Finite Automata Introduction
Automata Theory From Pda Grammars
Automata Theory Intersection Regular Languages
Automata Theory Lexical Analysis