Which of the following statements is/are FALSE?
(1) For every non-deterministic Turing machine, there exists an equivalent deterministic Turing machine.
(2) Turing recognizable languages are closed under union and complementation.
(3) Turing decidable languages are closed under intersection and complementation
(4) Turing recognizable languages are closed under union and intersection.
A) 1 and 4 only
B) 1 and 3 only
C) 2 only
D) 3 only
Correct Answer:
Verified
Q40: FSM can recognize
A)Any grammar
B)Only CG
C)Both (a) and
Q41: Basic limitation of FSM is that it
A)Cannot
Q42: Which of the following are decidable?
1) Whether
Q43: If L and L¯ are recursively enumerable,
Q44: Which of the following problems is undecidable?
A)Membership
Q45: Fred created a new automaton model which
Q47: Consider a string s over (0+1)*. The
Q48: Which one of the following is true
Q49: Which statement is true?
A)The PDA must have
Q50: TM is more powerful than FSM because
A)The
Unlock this Answer For Free Now!
View this answer and more for free by performing one of the following actions
Scan the QR code to install the App and get 2 free unlocks
Unlock quizzes for free by uploading documents